A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 921-932

  Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALL PAIRS SHORTEST PATHS; CUBIC ALGORITHM; EDGE LENGTH; SHORTEST PATH PROBLEM; TIME ALGORITHMS;

DIRECTED GRAPHS; GRAPH THEORY;

DIRECTED GRAPHS;

EID: 35048829333     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_78     Document Type: Article

References (31)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.
2. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. Journal of Computer and System Sciences, 54:255-262, 1997.
3. V. L. Arlazarov, E. C. Dinic, M. A. Kronrod, and I. A. Faradzev. On economical construction of the transitive closure of a directed graph. Doklady Akademii Nauk SSSR, 194:487-488, 1970.
4. English translation in Soviet Mathematics Doklady, 11:1209-1210, 1970.
5. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
6. 2) barrier. In Proc. of 41st FOCS, pages 381-389, 2000.
7. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
8. W. Dobosiewicz. A more efficient algorithm for the min-plus multiplication. International Journal of Computer Mathematics, 32:49-60, 1990.
9. R. W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5(6):345, 1962.
10. M. L. Fredman. New bounds on the complexity of the shortest path problem. SIAM Journal on Computing, 5:49-60, 1976.
11. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
12. M. E. Furman. Application of a method of rapid multiplication of matrices to the problem of finding the transitive closure of a graph. Doklady Akademii Nauk SSSR, 194:524, 1970.
13. English translation in Soviet Mathematics Doklady, 11:1252, 1970.
14. Z. Galil and O. Margalit. All pairs shortest distances for graphs with small integer length edges. Information and Computation, 134:103-139, 1997.
15. Z. Galil and O. Margalit. All pairs shortest paths for graphs with small integer length edges. Journal of Computer and System Sciences, 54:243-254, 1997.
16. T. Hagerup. Improved shortest paths on the word RAM. In Proc. of 27th ICALP, pages 61-72, 2000.
17. D. B. Johnson. Efficient algorithms for shortest paths in sparse graphs. Journal of the ACM, 24:1-13, 1977.
18. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. of 40th FOCS, pages 81-91, 1999.
19. I. Munro. Efficient determination of the transitive closure of a directed graph. Information Processing Letters, 1(2):56-58, 1971.
20. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science, 312(1):47-74, 2004.
21. S. Pettie and V. Ramachandran. Computing shortest paths with comparisons and additions. In Proc. of 13th SODA, pages 267-276, 2002.
22. L. Roditty and U. Zwick. Improved dynamic reachability algorithms for directed graphs. In Proc. of 43rd FOCS, pages 679-688, 2002.
23. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences, 51:400-403, 1995.
24. A. Shoshan and U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proc. of 40th FOCS, pages 605-614, 1999.
25. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
26. T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem. Information Processing Letters, 43:195-199, 1992.
27. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46:362-394, 1999.
28. S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11-12, 1962.
29. 2. 81 infinite-precision multiplications. Information Processing Letters, 4:155-156, 1976.
30. U. Zwick. Exact and approximate distances in graphs - a survey. In Proc. of 9th ESA, pages 33-48, 2001.
31. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49:289-317, 2002.