Abstract
Distance labelings and compact routing schemes have both been active areas of recent research. It was already known that graphs with constant-sized recursive separators, such as trees, outerplanar graphs, series-parallel 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 many classes of graphs known to admit exact distance labelings that do not have constant-sized separators. Our main result is to demonstrate that every unweighted, undirected n-vertex graph which supports an exact distance labeling with l(n)-sized labels also supports a compact routing scheme with O(l(n) + log2 n/loglogn)-sized headers, \(O(\sqrt{n}(l(n) + \log^2{n}/\log{\log{n}}))\)-sized routing tables, and an additive stretch of 6.
We then investigate two classes of graphs which support exact distance labelings (but do not guarantee constant-sized separators), where we can improve substantially on our general result. In the case of interval graphs, we present a compact routing scheme with O(logn)-sized headers, O(logn)-sized routing tables and additive stretch 1, improving headers and table sizes from a result of [1], which uses O(log3 n/loglogn)-bit headers and tables. We also present a compact routing scheme for the related family of circular arc graphs which guarantees O(log2 n)-sized headers, O(logn)-sized routing tables and an additive stretch of 1.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dragan, F.F., Lomonosov, I.: On compact and efficient routing in certain graph classes (Extended abstract). In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 402–414. Springer, Heidelberg (2004)
Breuer, M.A., Folkman, J.: An unexpected result on coding the vertices of a graph. J. Mathematical Analysis and Applications 20(3), 583–600 (1967)
Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 30–41. Springer, Heidelberg (1999)
Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53(1), 85–112 (2004)
Katz, M., Katz, N.A., Peleg, D.: Distance labeling schemes for well-separated graph classes. Discrete Applied Mathematics 145(3), 384–402 (2005)
Gavoille, C., Paul, C.: Optimal distance labeling for interval and circular-arc graphs. In: Proc. 11th Annual European Symp. on Algorithms, pp. 254–265 (2003)
Bazzaro, F., Gavoille, C.: Localized and compact data-structure for comparability graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1122–1131. Springer, Heidelberg (2005)
Arias, M., Cowen, L., Laing, K., Rajaraman, R., Taka, O.: Compact routing with name independence. In: Proc. 15th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 184–192 (2003)
Dor, D., Halperin, S., Zwick, U.: All pairs almost shortest paths. In: Proc. 37th Annual Symp. on Foundations of Computer Science (FOCS), pp. 452–461 (1996)
Elkin, M., Peleg, D.: (1+ε, β)-spanner constructions for general graphs. SIAM J. Comput. 33(3), 608–631 (2004)
Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: New constructions of (α, β)-spanners and purely additive spanners. In: Proc. 16th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 672–681 (2005)
Dragan, F.F., Yan, C., Corneil, D.G.: Collective tree spanners and routing in at-free related graphs. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 68–80. Springer, Heidelberg (2004)
Fraigniaud, P., Gavoille, C.: Routing in trees. In: Proc. 28th Intl. Colloq. on Automata, Languages and Programming (ICALP), pp. 757–772 (2001)
Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 13th Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 1–10. ACM, New York (2001)
Cowen, L.: Compact routing with minimum stretch. J. Algorithms 38(1), 170–183 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brady, A., Cowen, L. (2006). Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes. In: Dolev, S. (eds) Distributed Computing. DISC 2006. Lecture Notes in Computer Science, vol 4167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864219_24
Download citation
DOI: https://doi.org/10.1007/11864219_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44624-8
Online ISBN: 978-3-540-44627-9
eBook Packages: Computer ScienceComputer Science (R0)