# Distance and routing labeling schemes for cube-free median graphs

1 ACRO - Algorithmique, Combinatoire et Recherche Opérationnelle
LIS - Laboratoire d'Informatique et Systèmes
2 DALGO - Algorithmique Distribuée
LIS - Laboratoire d'Informatique et Systèmes
Abstract : 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. Similarly, routing labeling schemes label the vertices of a graph in a such a way that given the labels of a source node and a destination node, it is possible to compute efficiently the port number of the edge from the source that heads in the direction of the destination. One of important problems is finding natural classes of graphs admitting distance and/or routing 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 and routing labeling schemes with labels of $O(\log^3 n)$ bits.
Document type :
Conference papers
Domain :

Cited literature [64 references]

https://hal.archives-ouvertes.fr/hal-02268771
Contributor : Victor Chepoi <>
Submitted on : Wednesday, May 20, 2020 - 12:32:39 PM
Last modification on : Wednesday, May 27, 2020 - 4:15:50 PM

### File

1809.10508.pdf
Files produced by the author(s)

### Citation

Victor Chepoi, Arnaud Labourel, Sébastien Ratel. Distance and routing labeling schemes for cube-free median graphs. 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019, Aachen, Germany. pp.15:1--15:14, ⟨10.4230/LIPIcs.MFCS.2019.15⟩. ⟨hal-02268771⟩

Record views