Distance Labeling Schemes for Cube-Free Median Graphs
Victor D. Chepoi, Arnaud Labourel, Ratel, Sébastien · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2019
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(log^3 n) bits.