We propose a labeling scheme for unweighted undirected graphs, that is an assignment of binary labels to vertices of a graph such that the distance between any pair of vertices can be decoded solely from their labels. Recently, Alstrup, Dahlgaard, Knudsen, and Porat (2015) have shown a labeling scheme for sparse graphs with labels of size $O(\frac{n}{D} \log^2 D)$ where $D = \frac{\log n}{\log \frac{m+n}{n}}$. We present a simpler approach achieving size $O(\frac{n}{D} \log D)$ with $O(n^\varepsilon)$ decoding time. Based on similar techniques we also present a scheme for general graphs with labels of size $\frac{\log 3}{2}n + o(n)$ with small decoding time (any $\omega(1)$ decoding time is possible), or labels of size $(\frac{\log 3}{2}+\varepsilon) n$ and decoding time $O(1)$. This almost matches the currently best scheme of Alstrup, Gavoille, Halvorsen, and Petersen (2015) which uses labels of size $\frac{\log 3}{2}n + o(n)$ with decoding time $O(1)$. We believe our simple techniques are of independent value and provide a desirable simplification of the previous approaches.
[1]
Stephen Alstrup,et al.
Simpler, faster and shorter labels for distances in graphs
,
2015,
SODA.
[2]
49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA
,
2008,
FOCS.
[3]
Ran Raz,et al.
Distance labeling in graphs
,
2001,
SODA '01.
[4]
David Peleg,et al.
A note on exact distance labeling
,
2011,
Inf. Process. Lett..
[5]
R. Graham,et al.
On embedding graphs in squashed cubes
,
1972
.
[6]
Noga Alon,et al.
The Probabilistic Method
,
2015,
Fundamentals of Ramsey Theory.
[7]
Béla Bollobás,et al.
Sparse distance preservers and additive spanners
,
2003,
SODA '03.
[8]
Paolo Ferragina,et al.
On compact representations of All-Pairs-Shortest-Path-Distance matrices
,
2010,
Theor. Comput. Sci..
[9]
Mathias Bæk Tejs Knudsen,et al.
Sublinear distance labeling for sparse graphs
,
2015,
ArXiv.
[10]
Brighten Godfrey,et al.
Distance Oracles for Stretch Less Than 2
,
2013,
SODA.