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 of trees, bounded treewidth graphs, planar graphs, k-chordal graphs, and graphs with a dominating pair (including for instance interval, permutation, and AT-free graphs). We also establish lower bounds, and prove that most of our schemes are optimal in terms of the length of the labels generated and the quality of the approximation.
|Title of host publication||Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings|
|Editors||Friedhelm Meyer auf der Heide|
|Number of pages||12|
|State||Published - 2001|
|Event||9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark|
Duration: 28 Aug 2001 → 31 Aug 2001
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||9th Annual European Symposium on Algorithms, ESA 2001|
|Period||28/08/01 → 31/08/01|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
- Approximate distance
- Distributed data structures
- Labeling schemes
- Local representations