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

ACM Transactions on Algorithms

Volumn 8, Issue 4, 2012, Pages

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DIAMETER PROBLEM; RUNNING TIME; SHORTEST PATH; TIME BOUND; UNDIRECTED GRAPH; UNWEIGHTED DIRECTED GRAPHS;

ALGORITHMS; MATHEMATICAL TECHNIQUES;

GRAPH THEORY;

EID: 84870216811     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2344422.2344424     Document Type: Article

References (36)

1. AHUJA, R. K., MEHLHORN, K., ORLIN, J. B., AND TARJAN, R. E. 1990. Faster algorithms for the shortest path problem. J. ACM 37, 213-223. (Pubitemid 20696133)
2. AINGWORTH, D., CHEKURI, C., INDYK, P., AND MOTWANI, R. 1999. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28, 1167-1181.
3. ALBERS, S. AND HAGERUP, T. 1997. Improved parallel integer sorting without concurrent writing. Inf. Comput. 136, 25-51. (Pubitemid 127451771)
4. ALON, N., GALIL, Z., AND MARGALIT, O. 1997. On the exponent of the all pairs shortest path problem. J. Comput. Sys. Sci. 54, 255-262. (Pubitemid 127433373)
5. ARLAZAROV, V. L., DINIC, E. C., KRONROD, M. A., AND FARADZEV, I. A. 1970. On economical construction of the transitive closure of a directed graph. Soviet Math. Dokl. 11, 1209-1210.
6. BANSAL, N. AND WILLIAMS, R. 2009. Regularity lemmas and combinatorial algorithms. In Proceedings of the 50th IEEE Symposium on Foundations of Computer Science. 745-754.
7. BUCHSBAUM, A. L., KAPLAN, H., ROGERS, A., ANDWESTBROOK, J. R. 1998. Linear-time pointer-machine algorithms for least common ancestors, mst verification, and dominators. In Proceedings of the 30th ACMSymposium on the Theory of Computing. 279-288.
8. CHAN, T. M. 2008. All-pairs shortest paths with real weights in O(n3/log n) time. Algorithmica 50, 236-243.
9. CHAN, T. M. 2010. More algorithms for all-pairs shortest paths in weighted graphs. SIAM J. Comput. 39, 2075-2089.
10. COPPERSMITH, D. AND WINOGRAD, S. 1990. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9, 251-280.
11. DOBOSIEWICZ, W. 1990. A more efficient algorithm for the min-plus multiplication. Int. J. Computer Math. 32, 49-60.
12. DOR, D., HALPERIN, S., AND ZWICK, U. 2000. All pairs almost shortest paths. SIAM J. Comput. 29, 1740-1759. (Pubitemid 32021664)
13. FEDER, T. AND MOTWANI, R. 1995. Clique partitions, graph compression and speeding-up algorithms. J. Comput. Sys. Sci. 51, 261-272.
14. FREDERICKSON, G. N. 1987. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16, 1004-1022.
15. FREDMAN, M. L. 1976. New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5, 49-60.
16. GALIL, Z. AND MARGALIT, O. 1997a. All pairs shortest distances for graphs with small integer length edges. Inf. Comput. 134, 103-139. (Pubitemid 127451748)
17. GALIL, Z. AND MARGALIT, O. 1997b. All pairs shortest paths for graphs with small integer length edges. J. Comput. Sys. Sci. 54, 243-254. (Pubitemid 127433372)
18. HAGERUP, T. 2000. Improved shortest paths on the word RAM. In Proceedings of the 27th International Colloquium Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 1853, 61-72.
19. HAN, Y. 2004. Improved algorithm for all pairs shortest paths. Inf. Proc. Lett. 91, 245-250.
20. 5/4) time algorithm for all pairs shortest paths. Algorithmica 51, 428- 434. (Pubitemid 351705754)
21. KING, V. 1999. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proceedings of the 40th IEEE Symposium on the Foundations of Computer Science 81-91.
22. PETTIE, S. 2004. A new approach to all-pairs shortest paths on real-weighted graphs. Theoret. Comput. Sci. 312, 47-74.
23. PETTIE, S. AND RAMACHANDRAN, V. 2005. A shortest path algorithm for real-weighted undirected graphs. SIAM J. Comput. 34, 1398-1431. (Pubitemid 43003148)
24. SEIDEL, R. 1995. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Sys. Sci. 51, 400-403.
25. SHOSHAN, A. AND ZWICK, U. 1999. All pairs shortest paths in undirected graphs with integer weights. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science 605-614. (Pubitemid 30539947)
26. 2 n). SIAM J. Comput. 2, 28-32.
27. STRASSEN, V. 1969. Gaussian elimination is not optimal. Numer. Math. 13, 354-356.
28. TAKAOKA, T. 1992. A new upper bound on the complexity of the all pairs shortest path problem. Inf. Proc. Lett. 43, 195-199.
29. TAKAOKA, T. 1998. Subcubic cost algorithms for the all pairs shortest path problem. Algorithmica 20, 309-318. (Pubitemid 128664707)
30. TAKAOKA, T. 2004. A faster algorithm for the all-pairs shortest path problem and its application. In Proceedings of the 10th International Conference on Comput. Comb. Lecture Notes in Computer Science, vol. 3106, 278-289.
31. THORUP, M. 1999. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46, 362-394.
32. THORUP, M. 2004. Integer priority queues with decrease key in constant time and the single source shortest paths problem. J. Comput. Sys. Sci. 69, 330-353.
33. ULLMAN, J. D. AND YANNAKAKIS, M. 1991. High-probability parallel transitive-closure algorithms. SIAM J. Comput. 20, 100-125.
34. YUSTER, R. AND ZWICK, U. 2005. Fast sparse matrix multiplication. ACM Trans. Algorithms 1, 2-13.
35. ZWICK, U. 2002. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49, 289-317.
36. ZWICK, U. 2006. A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. Algorithmica 46, 181-192. (Pubitemid 44370970)