Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1999: Computing and Combinatorics pp 51–60Cite as

An External Memory Data Structure for Shortest Path Queries (Extended Abstract)

  • Conference paper
  • First Online:

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

Abstract

We present results related to satisfying shortest path queries on a planar graph stored in external memory. In particular, we show how to store rooted trees in external memory so that bottom-up paths can be traversed I/O-efficiently, and we present I/O-efficient algorithms for tri-angulating planar graphs and computing small separators of such graphs. Using these techniques, we can construct a data structure that allows for answering shortest path queries on a planar graph I/O-efficiently.

For details see [12].

Research partially supported by NSERC.

Research partially supported by Studienstiftung des deutschen Volkes.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D.E. Vengroff, J. S. Vitter. External-memory graph algorithms. Proc. 6th SODA, Jan. 1995.

    Google Scholar 

  2. A. Crauser, K. Mehlhorn, U. Meyer. Kürzeste-Wege-Berechnung bei sehr groβen Datenmengen. Aachener Beitr. zur Inf. (21). Verl. d. Augustinus Buchh. 1997.

    Google Scholar 

  3. F. Dehne, W. Dittrich, D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. Proc. 9th SPAA, pp. 106–115, 1997.

    Google Scholar 

  4. H. N. Djidjev. Efficient algorithms for shortest path queries in planar digraphs. Proc. of the 22nd Workshop on Graph-Theoretic Concepts in Comp. Sci., Lecture Notes in Comp. Sci., pp. 151–165. Springer Verlag, 1996.

    Google Scholar 

  5. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comp., 16(6):1004–1022, Dec. 1987.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. J. Lipton, R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36(2):177–189, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  7. K. Munagala, A. Ranade. I/O-complexity of graph algorithms. Proc. 10th SODA, Jan. 1999.

    Google Scholar 

  8. M. Nodine, M. Goodrich, J. Vitter. Blocking for external graph searching. Algorithmica, 16(2):181–214, Aug. 1996.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Vitter. External memory algorithms. Proc. 17th ACM Symp. on Principles of Database Systems, June 1998.

    Google Scholar 

  10. J. Vitter, E. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110–147, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Vitter, E. Shriver. Algorithms for parallel memory II: Hierarchical multilevel memories. Algorithmica, 12(2-3):148–169, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  12. N. Zeh. An External-Memory Data Structure for Shortest Path Queries. Diplomarbeit, Fak. f. Math. und Inf., Friedrich-Schiller-Univ. Jena, Nov. 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Ottawa, Canada

    David Hutchinson, Anil Maheshwari & Norbert Zeh

  2. Fakultät für Math. und Inf., Friedrich-Schiller-Universität Jena, Germany

    Norbert Zeh

Authors
  1. David Hutchinson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anil Maheshwari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Norbert Zeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and System Engineering Faculty of Science and Engineering, Chuo University, 1-13-27, Kasuga, Bunkyo-ku, Tokyo, 112-8551, Japan

    Takano Asano

  2. Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Hideki Imai

  3. Academia Sinica, Institute of Information Science, Nankang, Taipei, Taiwan

    D. T. Lee

  4. Department of Computer Science Faculty of Engineering, Gunma University, 1-5-1 Tenjin-cho, Kiryu, Gunma, 376-8515, Japan

    Shin-ichi Nakano

  5. IBM Tokyo Research Laboratory, 1623-14, Shimo-Tsuruma, Yamato Kanagawa, 242-0001, Japan

    Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hutchinson, D., Maheshwari, A., Zeh, N. (1999). An External Memory Data Structure for Shortest Path Queries (Extended Abstract). In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48686-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66200-6

  • Online ISBN: 978-3-540-48686-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation