All-pairs shortest paths for unweighted undirected graphs in o(mn) time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 514-523

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; TIME SERIES ANALYSIS;

PATHS; RUNNING TIMES; VERTICES;

GRAPH THEORY;

EID: 33244486056     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109614     Document Type: Conference Paper

References (30)

1. R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan. Faster algorithms for the shortest path problem. J. ACM, 37:213-223, 1990.
2. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput., 28:1167-1181, 1999.
3. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. J. Comput. Sys. Sci., 54:255-262, 1997.
4. V. L. Arlazarov, E. C. Dinic, M. A. Kronrod, and I. A. Faradzev. On economical construction of the transitive closure of a directed graph. Soviet Math. Dokl., 11:1209-1210, 1970.
5. 3/log n) time. In Proc. 9th Workshop Algorithms Data Struct., Lect. Notes Comput. Sci., vol. 3608, Springer-Verlag, pages 318-324, 2005.
6. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9:251-280, 1990.
7. W. Dobosiewicz. A more efficient algorithm for the min-plus multiplication. Int. J. Computer Math., 32:49-60, 1990.
8. D. Dor, S. Halperin, and U. Zwick. All pairs almost shortest paths. SIAM J. Comput., 29:1740-1759, 2000.
9. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. J. Comput. Sys. Sci., 51:261-272, 1995.
10. M. L. Fredman. New bounds on the complexity of the shortest path problem. SIAM J. Comput., 5:49-60, 1976.
11. Z. Galil and O. Margalit. All pairs shortest distances for graphs with small integer length edges. Inf. Comput., 134:103-139, 1997.
12. Z. Galil and O. Margalit. All pairs shortest paths for graphs with small integer length edges. J. Comput. Sys. Sci., 54:243-254, 1997.
13. T. Hagerup. Improved shortest paths on the word RAM. In Proc. 27th Int. Collog. Automata, Languages, and Programming, Lect. Notes Comput. Sci., vol. 1853, Springer-Verlag, pages 61-72, 2000.
14. Y. Han. Improved algorithm for all pairs shortest paths. Inform. Process. Lett., 91:245-250, 2004.
15. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. 40th IEEE Sympos. Found. Comput. Sci., pages 81-91, 1999.
16. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoret. Comput. Sci., 312:47-74, 2004.
17. S. Pettie and V. Ramachandran. A shortest path algorithm for real-weighted undirected graphs. SIAM J. Comput., 34:1398-1431, 2005.
18. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Sys. Sci., 51:400-403, 1995.
19. A. Shoshan and U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proc. 40th IEEE Sympos. Found. Comput. Sci., pages 605-614, 1999.
20. 2n). SIAM J. Comput., 2:28-32, 1973.
21. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
22. T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett., 43:195-199, 1992.
23. T. Takaoka. Subcubic cost algorithms for the all pairs shortest path problem. Algorithmica, 20:309-318, 1998.
24. T. Takaoka. A faster algorithm for the all-pairs shortest path problem and its application. In Proc. 10th Int. Conf. Comput. Comb., Lect. Notes Comput. Sci., vol. 3106, Springer-Verlag, pages 278-289, 2004.
25. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46:362-394, 1999.
26. M. Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem. J. Comput. Sys. Sci., 69:330-353, 2004.
27. J. D. Ullman and M. Yannakakis. High-probability parallel transitive-closure algorithms. SIAM J. Comput., 20:100-125, 1991.
28. R. Yuster and U. Zwick. Fast sparse matrix multiplication. In Proc. 12th European Sympos. Algorithms, Lect. Notes Comput. Sci., vol. 3221, Springer-Verlag, pages 604-615, 2004.
29. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM, 49:289-317, 2002.
30. U. Zwick. A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. In Proc. 15th Int. Sympos. Algorithms and Computation, Lect. Notes Comput. Sci., vol. 3341, Springer-Verlag, pages 921-932, 2004.