Skip to main content
SpringerLink
Log in

An O(n 3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

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. Inf. Comput. 136, 25–51 (1997)

    Article  MATH  MathSciNet  Google Scholar 

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

  5. Chan, T.M.: All-pairs shortest paths with real weights in O(n 3/log n) time. In: Proc. 9th Workshop Algorithms Data Structures. Lecture Notes in Computer Science, vol. 3608, pp. 318–324. Springer, New York (2005)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Galil, Z., Margalit, O.: All pairs shortest distances for graphs with small integer length edges. Inf. Comput. 134, 103–139 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  10. Han, Y.: Improved algorithms for all pairs shortest paths. Inf. Process. Lett. 91, 245–250 (2004)

    Article  Google Scholar 

  11. Han, Y.: Achieving O(n 3/log n) time for all pairs shortest paths by using a smaller table. In: Proc. 21st Int. Conf. on Computers and Their Applications (CATA-2006), Seattle, Washington, pp. 36–37 (2006). To appear in Information Processing Letters as “A note of an O(n 3/log n) time algorithm for all pairs shortest paths”

  12. Pettie, S.: A faster all-pairs shortest path algorithm for real-weighted sparse graphs. In: Proceedings of 29th International Colloquium on Automata, Languages, and Programming (ICALP’02). Lecture Notes in Computer Science, vol. 2380, pp. 85-97 (2002)

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Sankowski, P.: Shortest paths in matrix multiplication time. In: Proceedings of 13th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 3669, pp. 770–778 (2005)

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

  16. Takaoka, T.: A new upper bound on the complexity of the all pairs shortest path problem. Inf. Process. Lett. 43, 195–199 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Takaoka, T.: An O(n 3log log n/log n) time algorithm for the all-pairs shortest path problem. Inf. Process. Lett. 96, 155–161 (2005)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

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

    Article  MathSciNet  Google Scholar 

  21. Zwick, U.: A slightly improved sub-cubic algorithm for the all pairs shortest paths problem. In: Proceedings of ISAAC 2004. Lecture Notes in Computer Science, vol. 3341, pp. 921–932. Springer, Berlin (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Yijie Han

Authors
  1. Yijie Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yijie Han.

Additional information

Research supported in part by NSF grant 0310245.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Han, Y. An O(n 3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path. Algorithmica 51, 428–434 (2008). https://doi.org/10.1007/s00453-007-9063-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9063-0

Keywords

Search

Navigation