Skip to main content
SpringerLink
Log in

I/O-Efficient Undirected Shortest Paths

  • Conference paper
Algorithms - ESA 2003 (ESA 2003)

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

Included in the following conference series:

Abstract

We present an I/O-efficient algorithm for the single-source shortest path problem on undirected graphs G=(V,E). Our algorithm performs \(\mathcal{O}\)(\(\sqrt{(VE/B){\rm log_2}(W/w)}\)sort(V + E)loglog(VB/E)) I/Os, where w ∈ ℝ +  and W ∈ ℝ +  are the minimal and maximal edge weights in G, respectively. For uniform random edge weights in (0,1], the expected I/O-complexity of our algorithm is \(\mathcal{O}\)(\(\sqrt{VE/B} + ((V + E)/B){log_2}B +\)sort(V+E)).

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

    Google Scholar 

  2. Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. Journal of the ACM 37(2), 213–233 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arge, L., Brodal, G.S., Toma, L.: On external memory MST, SSSP, and multiway planar separators. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 433–447. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proc. 6th ACM-SIAM SODA, pp. 139–149 (1995)

    Google Scholar 

  5. Crauser, A., Mehlhorn, K., Meyer, U., Sanders, P.: A parallelization of Dijkstra’s shortest path algorithm. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 722–731. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Dijkstra, E.W.: A note on two problems in connection with graphs. Numerical Mathematics 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34, 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  8. Kumar, V., Schwabe, E.J.: Improved algorithms and data structures for solving graph problems in external memory. In: Proc. 8th IEEE SPDP, pp. 169–176 (1996)

    Google Scholar 

  9. Mehlhorn, K., Meyer, U.: External-memory breadth-first search with sublinear I/O. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 723–773. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies. LNCS, vol. 2625. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  11. Raman, R.: Recent results on the single-source shortest paths problem. ACM SIGACT News 28(2), 81–87 (1997)

    Article  Google Scholar 

  12. Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM 46, 362–394 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  13. Vitter, J.S.: External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys 33(2), 209–271 (2001)

    Article  Google Scholar 

  14. Zeh, N.: I/O-Efficient Algorithms for Shortest Path Related Problems. PhD thesis, School of Computer Science, Carleton University (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Stuhlsatzhausenweg 85, 66123, Saarbrücken, Germany

    Ulrich Meyer

  2. Faculty of Computer Science, Dalhousie University, 6050 University Ave, Halifax, NS B3H 1W5, Canada

    Norbert Zeh

Authors
  1. Ulrich Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Norbert Zeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università degli Studi “Roma Tre”, via della Vasca Navale 79, 00146, Rome, Italy

    Giuseppe Di Battista

  2. School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Uri Zwick

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, U., Zeh, N. (2003). I/O-Efficient Undirected Shortest Paths. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39658-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39658-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation