On the all-pairs-shortest-path problem in unweighted undirected graphs

Journal of Computer and System Sciences

Volumn 51, Issue 3, 1995, Pages 400-403

  Seidel, Raimund ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0029509262     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1995.1078     Document Type: Article

References (17)

1. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem, in "Proceedings, 32nd FOCS, 1991, " pp. 569-575.
2. N. Alon. Z. Galil, O. Margalit, and M. Naor, Witnesses for Boolean matrix multiplication and for shortest paths, in "Proceedings, 33rd FOCS, 1992, " pp. 417-426.
3. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990). 251-280.
4. P. Dietz, private communication.
5. T. Feder and R. Motwani, Clique partitions, graphs compression and speeding-up algorithms, in "Proceedings, STOC, 1991, " pp. 123-133.
6. M. L. Fredman, New bounds on the complexity of the shortest path problem, SIAM J. Comput. 5 (1976), 83-89.
7. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Assoc. Comput. Mach. (1987), 596-615.
8. D. B. Johnson, Efficient algorithms for shortest paths in sparse networks, J. Assoc. Comput. Mach. (1977), 1-13.
9. Z. Galil and O. Margalit, On the exponent of the all pairs shortest path problem for undirected graphs, manuscript, April 1991.
10. Z. Galil and O. Margalit, All pairs shortest distances for graphs with small integer edge lengths, submitted.
11. H. N. Gabow, Scaling algorithms for network problems, J. Comput. System Sci. 31 (1985), 148-168.
12. D. R. Karger, private communication.
13. D. R. Karger, D. Koller, and S. J. Phillips, Finding the hidden path: Time bounds for all-pairs shortest paths, in "Proceedings, 32nd FOCS, 1991, " pp. 560-568.
14. C. C. McGeoch, Finding shortest paths with the optimal subgraph, manuscript, 1992.
15. V. Pan, "How to Multiply Matrices Faster." Lecture Notes in Computer Science, Vol. 179, Springer-Verlag, New York/Berlin, 1984.
16. F. Romani, Shortest-path problem is not harder than matrix multiplication, Inform. Process. Lett. 11 (1980), 134-136.
17. G. Yuval, An algorithm for finding all shortest paths using A7281 infinite-precision multiplications, Inform. Process. Lett. (1976), 155-156.