Skip to main content
SpringerLink
Log in

External Data Structures for Shortest Path Queries on Planar Digraphs

  • Conference paper
Algorithms and Computation (ISAAC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3827))

Included in the following conference series:

Abstract

In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any \(S = {\it \Omega}(N^{1 + \epsilon}\)) and S = O(N 2/B), our main result is a family of structures that use S space and answer queries in \(O({{N^{2}}\over{SB}})\)I/Os, thus obtaining optimal space-query product O(N 2/B). An S space structure can be constructed in \(O(\sqrt{S}\cdot {\rm sort}(N))\) I/Os, where sort(N) is the number of I/Os needed to sort N elements, B is the disk block size, and N is the size of the graph.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Aggarwal, A., Vitter, J.S.: The Input/Output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  2. Arge, L., Brodal, G.S., Toma, L.: On external memory MST, SSSP and multi-way planar graph separation. Journal of Algorithms 53(2), 186–2006 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arge, L., Meyer, U., Toma, L.: External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 146–157. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Arge, L., Meyer, U., Toma, L., Zeh, N.: On external-memory planar depth first search. Journal of Graph Algorithms 7(2), 105–129 (2003)

    MATH  MathSciNet  Google Scholar 

  5. Arge, L., Toma, L., Zeh, N.: I/O-efficient topological sorting of planar DAGs. In: Proc. ACM Symp. on Parallel Algorithms and Architectures (2003)

    Google Scholar 

  6. Arge, L., Zeh, N.: I/O-efficient strong connectivity and depth-first search for directed planar graphs. In: Proc. IEEE Symp. on Foundations of Computer Science, pp. 261–270 (2003)

    Google Scholar 

  7. Arikati, S., Chen, D., Chew, L., Das, G., Smid, M., Zaroliagis, C.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 514–528. Springer, Heidelberg (1996)

    Google Scholar 

  8. Buchsbaum, A., Goldwasser, M., Venkatasubramanian, S., Westbrook, J.: On external memory graph traversal. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 859–860 (2000)

    Google Scholar 

  9. Chaudhuri, S., Zaroliagis, C.: Shortest path queries in digraphs of small treewidth. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 244–255. Springer, Heidelberg (1995)

    Google Scholar 

  10. Chen, D., Xu, J.: Shortest path queries in planar graphs. In: Proc. ACM Symp. on Theory of Computation, pp. 469–478. ACM Press, New York (2000)

    Google Scholar 

  11. Chiang, Y., Goodrich, M., Grove, E., Tamassia, R., Vengroff, D., Vitter, J.S.: External-memory graph algorithms. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 139–149 (1995)

    Google Scholar 

  12. Djidjev, H.: Efficient algorithms for shortest path queries in planar digraphs. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 151–165. Springer, Heidelberg (1997)

    Google Scholar 

  13. Djidjev, H., Pantziou, G., Zaroliagis, C.: Computing shortest paths and distances in planar graphs. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 327–338. Springer, Heidelberg (1991)

    Google Scholar 

  14. Frederickson, G.: Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14(4), 781–798 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Frederickson, G.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing 16, 1004–1022 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hutchinson, D., Maheshwari, A., Zeh, N.: An external-memory data structure for shortest path queries. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 51–60. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Kumar, V., Schwabe, E.: Improved algorithms and data structures for solving graph problems in external memory. In: Proc. IEEE Symp. on Parallel and Distributed Processing, pp. 169–177 (1996)

    Google Scholar 

  18. Lipton, R., Tarjan, R.: A separator theorem for planar graphs. SIAM Journal of Applied Math. 36, 177–189 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  19. Maheshwari, A., Zeh, N.: I/O-optimal algorithms for planar graphs using separators. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 372–381 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Duke University, Durham, NC, 27708, USA

    Lars Arge

  2. Bowdoin College, Brunswick, ME, 04011, USA

    Laura Toma

Authors
  1. Lars Arge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laura Toma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon , Hong Kong

    Xiaotie Deng

  2. Department of Computer Science, University of Texas at Dallas, EE/CS Building, 75083, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arge, L., Toma, L. (2005). External Data Structures for Shortest Path Queries on Planar Digraphs. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_34

Download citation

  • DOI: https://doi.org/10.1007/11602613_34

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation