Distance Labeling Schemes for Cube-Free Median Graphs - Archive ouverte HAL
Communication Dans Un Congrès Année : 2019

Distance Labeling Schemes for Cube-Free Median Graphs

Résumé

Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that 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 distance labeling schemes with labels of polylogarithmic size. In this paper, we show that the class of cube-free median graphs on n nodes enjoys distance labeling scheme with labels of O(log3 n) bits.
Fichier non déposé

Dates et versions

hal-03581536 , version 1 (19-02-2022)

Identifiants

Citer

Victor Chepoi, Arnaud Labourel, Sébastien Ratel. Distance Labeling Schemes for Cube-Free Median Graphs. MFCS 2019, 2019, Aachen, Germany. ⟨10.4230/LIPIcs.MFCS.2019.15⟩. ⟨hal-03581536⟩
29 Consultations
0 Téléchargements

Altmetric

Partager

More