Distance labeling schemes for $K_4$-free bridged graphs - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2022

Distance labeling schemes for $K_4$-free bridged graphs

Résumé

$k$-Approximate distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the $k$-approximation of the distance between any two vertices $u$ and $v$ can be determined efficiently by merely inspecting the labels of $u$ and $v$, without using any other information. One of the important problems is finding natural classes of graphs admitting exact or approximate distance labeling schemes with labels of polylogarithmic size. In this paper, we describe an approximate distance labeling scheme for the class of $K_4$-free bridged graphs. This scheme uses labels of poly-logarithmic length $O(\log n^3)$ allowing a constant decoding time. Given the labels of two vertices $u$ and $v$, the decoding function returns a value between the exact distance $d_G(u,v)$ and its quadruple $4d_G(u,v)$.
Fichier principal
Vignette du fichier
2007.14192.pdf (1.38 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03550015 , version 1 (24-03-2024)

Identifiants

Citer

Victor Chepoi, Arnaud Labourel, Sébastien Ratel. Distance labeling schemes for $K_4$-free bridged graphs. 2024. ⟨hal-03550015⟩
51 Consultations
12 Téléchargements

Altmetric

Partager

More