Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Proximity-Preserving Labeling Schemes
Proximity-Preserving Labeling Schemes
Journal of Algorithms
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
| Hi-index | 0.00 |
Distance labelings -- introduced as a new way to encode graph topology in a distributed fashion -- have been an active area of research (see [1, 2] for details). In both exact and approximate settings, results in distance labelings and compact routing (for an introduction, esp. for definitions of routing tables and headers, see [3]) seem to go hand in hand, but so far these results have been produced separately. It was already known that graphs with constantsized separators such as trees, outerplanar graphs, seriesparallel graphs and graphs of bounded treewidth, support both exact distance labelings and optimal (additive stretch 0, multiplicative stretch 1) compact routing schemes, but there are classes of graphs known to admit exact distance labelings which do not have constant-sized separators. Our main result is to demonstrate that every n-vertex graph which supports an exact distance labeling with O(l(n))-sized labels also supports a compact routing scheme with O(l(n) + log2 n)-sized headers, O(√n(l(n) + log2 n))-sized routing tables, and an additive stretch of 6. Our general result produces the first known compact routing schemes for classes of graphs where no previous compact routing scheme was known, such as permutation graphs.We note that it is possible to improve substantially on our general result for the classes of interval graphs and circular arc graphs (neither of which admits constant-sized separators). In both cases, a compact routing scheme exists with polylogarithmic headers and routing tables, and an additive stretch of 1; due to space constraints, we defer further discussion of these cases to future presentations of this work.