Compact routing with additive stretch using distance labelings
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
This paper considers informative labeling schemes for graphs. Specifically, the question considered is whether it is possible to label the vertices of a graph with short labels in such a way that the distance between any two vertices can be inferred from inspecting their labels. It is shown that for the class of n-vertex trees, there exists such a labeling scheme using O(log2 n) bit labels. For the family of all n-vertex graphs, a labeling scheme is proposed that using O(log3 n) bit labels can provide approximate estimates to the distance, which are accurate up to a factor of O{2logn}.