Skip to main content
SpringerLink
Log in

An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths

  • Conference paper
Book cover Algorithm Theory – SWAT 2012 (SWAT 2012)

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

Included in the following conference series:

Abstract

We present an O(n 3 loglogn/log2 n) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n 3 (loglogn)3/log2 n ) time.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  2. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)

    MATH  Google Scholar 

  3. Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. Information and Computation 136, 25–51 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Batcher, K.E.: Sorting networks and their applications. In: Proc. 1968 AFIPS Spring Joint Summer Computer Conference, pp. 307–314 (1968)

    Google Scholar 

  5. Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proc. 2007 ACM Symp. Theory of Computing, pp. 590–598 (2007)

    Google Scholar 

  6. Chan, T.M.: All-Pairs Shortest Paths with Real Weights in O(n 3/logn) Time. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 318–324. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Dobosiewicz, W.: A more efficient algorithm for min-plus multiplication. Inter. J. Comput. Math. 32, 49–60 (1990)

    Article  MATH  Google Scholar 

  8. Fredman, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. Computing 5, 83–89 (1976)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Galil, Z., Margalit, O.: All pairs shortest distances for graphs with small integer length edges. Information and Computation 134, 103–139 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Han, Y.: An O(n 3(loglogn/logn)5/4) time algorithm for all pairs shortest paths. Algorithmica 51(4), 428–434 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Han, Y.: Improved algorithms for all pairs shortest paths. Information Processing Letters 91, 245–250 (2004)

    Article  MathSciNet  Google Scholar 

  13. Han, Y.: A note of an O(n 3/logn) time algorithm for all pairs shortest paths. Information Processing Letters 105, 114–116 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pettie, S.: A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 85–97. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Pettie, S., Ramachandran, V.: A shortest path algorithm for real-weighted undirected graphs. SIAM J. Comput. 34(6), 1398–1431 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sankowski, P.: Shortest Paths in Matrix Multiplication Time. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 770–778. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Seidel, R.: On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci. 51, 400–403 (1995)

    Article  MathSciNet  Google Scholar 

  18. Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 14(3), 354–356 (1969)

    Article  MathSciNet  Google Scholar 

  19. Takaoka, T.: A new upper bound on the complexity of the all pairs shortest path problem. Information Processing Letters 43, 195–199 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Takaoka, T.: An O(n 3 loglogn/logn) time algorithm for the all-pairs shortest path problem. Information Processing Letters 96, 155–161 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  22. Yuster, R., Zwick, U.: Answering distance queries in directed graphs using fast matrix multiplication. In: 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 389–396. IEEE Comput. Soc., Los Alamitos (2005)

    Chapter  Google Scholar 

  23. Zwick, U.: All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM 49(3), 289–317 (2002)

    Article  MathSciNet  Google Scholar 

  24. Zwick, U.: A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 921–932. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Engineering, University of Missouri at Kansas City, Kansas City, MO, 64110, USA

    Yijie Han

  2. Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand

    Tadao Takaoka

Authors
  1. Yijie Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tadao Takaoka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Fedor V. Fomin

  2. Department of Information and Computer Science, Aalto University, PO Box 15400, 00076, Aalto, Finland

    Petteri Kaski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, Y., Takaoka, T. (2012). An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths. In: Fomin, F.V., Kaski, P. (eds) Algorithm Theory – SWAT 2012. SWAT 2012. Lecture Notes in Computer Science, vol 7357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31155-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31155-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31154-3

  • Online ISBN: 978-3-642-31155-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation