Skip to main content
SpringerLink
Log in

Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract)

  • Conference paper
  • First Online:
Automata, Languages and Programming

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1644))

Abstract

For planar graphs on n nodes we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log2+∈n) bit-operations per node to extract the route, with constant ∈ > 0. We generalize the result for every graph of bounded crossing-edge number. We also extend our result to any graph of genus bounded by γ, by building shortest path routing tables of n log (γ + 1)+ O(n) bits per node, and with O(log2+∈n) bit-operations per node to extract the route. This result is obtained by the use of dominating sets, compact coding of non-crossing partitions, and k-page representation of graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Bilski, Embedding graphs in books: A survey, IEE Proceedings-E, 139 (1992), pp. 134–138.

    Google Scholar 

  2. F. Bernhart and P.C. Kainen, The book thickness of a graph, Journal of Combinatorial Theory, 27 (1979), pp. 320–331.

    Article  MathSciNet  Google Scholar 

  3. R.C.-N. Chuang, A. Garg, X. He, M.-Y. Kao, and H.-I. LU, Compact encodings of planar graphs via canonical orderings and multiple parentheses, in 25th International Colloquium on Automata, Languages and Programming (ICALP), K. Guldstrand Larsen, S. Skyum, and G. Winskel, eds., vol. 1443 of Lecture Notes in Computer Science, Springer, July 1998, pp. 1–12.

    Google Scholar 

  4. A. Denise, M. Vasconcellos, and D. Welsh, The random planar graph, Congressus Numerantium, 113 (1996), pp. 61–79.

    MathSciNet  MATH  Google Scholar 

  5. T. Eilam, C. Gavoille, and D. Peleg, Compact routing schemes with low stretch factor, in 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, ed., August 1998, pp. 11–20.

    Google Scholar 

  6. C. Gavoille and N. Hanusse, Compact routing tables for graphs of bounded genus, Research Report RR-1213-99, LaBRI, University of Bordeaux, 351 cours de la Libération, 33405 Talence Cedex, France, February 1999. To appear in ICALP’ 99.

    Google Scholar 

  7. C. Gavoille and S. PÉrennÈs, Memory requirement for routing in distributed networks, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, ed., May 1996, pp. 125–133.

    Google Scholar 

  8. L. Heath and S. Istrail, The pagenumber of genus g graphs is O(g), in 19th Annual ACM Symposium on Theory of Computing (STOC), 1987, pp. 388–397.

    Google Scholar 

  9. G. Jacobson, Space-efficient static trees and graphs, in 30th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, October 1989, pp. 549–554.

    Google Scholar 

  10. P. Klein, S. Rao, M. Rauch, and S. Subramanian, Faster shortest-path algorithms for planar graphs, in 26th Annual ACM Symposium on Theory of Computing (STOC), 1994, pp. 27–37.

    Google Scholar 

  11. K. Keeler and J. Westbrook, Short encodings of planar graphs and maps, Discrete Applied Mathematics, 58 (1995), pp. 239–252.

    Article  MathSciNet  Google Scholar 

  12. S.M. Malitz, Genus g graphs have pagenumber O(pg), in 29th Symposium on Foundations of Computer Science (FOCS), IEEE, ed., October 1988, pp. 458–468.

    Google Scholar 

  13. J.I. Munro and V. Raman, Succint representation of balanced parentheses, static trees and planar graphs, in 38rd Symposium on Foundations of Computer Science (FOCS), IEEE, ed., October 1997, pp. 118–126.

    Google Scholar 

  14. D. Peleg and E. Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM, 36 (1989), pp. 510–530.

    Article  MathSciNet  Google Scholar 

  15. G. TurÁn, Succint representations of graphs, Discrete Applied Mathematics, 8 (1984), pp. 289–294.

    Article  MathSciNet  Google Scholar 

  16. W.T. Tutte, A census of planar triangulations, Canadian Journal of Mathematics, 14 (1962), pp. 21–38.

    Article  MathSciNet  Google Scholar 

  17. M. Yannakakis, Four pages are necessary and sufficient for planar graphs, in 18th Annual ACM Symposium on Theory of Computing (STOC), 1986, pp. 104–108.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université Bordeaux I, 351 cours de la Libération, 33405, Talence Cedex, France

    Cyril Gavoille & Nicolas Hanusse

Authors
  1. Cyril Gavoille
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolas Hanusse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Academy of Sciences of the Czech Republic, Pod vodarenskou vezi 2, 182 07, Prague 8 - Liben, Czech Republic

    Jirí Wiedermann

  2. ILLC-WINS-University of Amsterdam, Plantage Muidergracht 24, 1018, TV, Amsterdam, The Netherlands

    Peter van Emde Boas

  3. BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, DK, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gavoille, C., Hanusse, N. (1999). Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-48523-6_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66224-2

  • Online ISBN: 978-3-540-48523-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation