Approximate Distance Labeling Schemes


We consider the problem of labeling the nodes of an n-node graph G with short labels in such a way that the distance between any two nodes u, v of G can be approximated efficiently (in constant time) by merely inspecting the labels of u and v, without using any other information. We develop such constant approximate distance labeling schemes for the classes… (More)
DOI: 10.1007/3-540-44676-1_40


Cite this paper

@inproceedings{Gavoille2000ApproximateDL, title={Approximate Distance Labeling Schemes}, author={Cyril Gavoille and Michal Katz and Nir A. Katz and Christophe Paul and David Peleg}, booktitle={ESA}, year={2000} }