Sublinear distance labeling for sparse graphs

@article{Alstrup2015SublinearDL,
  title={Sublinear distance labeling for sparse graphs},
  author={Stephen Alstrup and S\oren Dahlgaard and Mathias B{\ae}k Tejs Knudsen and Ely Porat},
  journal={CoRR},
  year={2015},
  volume={abs/1507.02618}
}
A distance labeling scheme labels the n nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the two nodes by looking only at the labels. A D-preserving distance labeling scheme only returns precise distances between pairs of nodes that are at distance at least D from each other. In this paper we consider distance labeling schemes for the classical case of unweighted and undirected graphs. We present the first… CONTINUE READING