All Pairs Shortest Distances for Graphs with Small Integer Length Edges

Information and Computation

Volumn 134, Issue 2, 1997, Pages 103-139

  Galil, Zvi ^a   Margalit, Oded ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006712603     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2620     Document Type: Article

References (5)

1. Alon, N., Galil, Z., and Margalit, O. (1991), On the exponent of All Pairs Shortest Path problem, in "Proceedings, 32th Annual Symposium on Foundations of Computer Science, 1991," pp. 569-575; a full version to appear in J. Comput. System Sci.
2. Alon, N., Galil, Z., and Margalit, O. (1991), On the exponent of All Pairs Shortest Path problem, in "Proceedings, 32th Annual Symposium on Foundations of Computer Science, 1991," pp. 569-575; a full version to appear in J. Comput. System Sci.
3. Awerbuch, personal communication.
4. Coppersmith, D., and Winograd, S. (1981), Matrix multiplication via arithmetic progressions, in "Proceedings, 19th Annual Symposium on Theory of Computing," pp. 1-6.
5. Seidel, R. (1992), On the All-Pairs-Shortest-Path problem, in "Proceedings, 24th Annual Symposium on Theory of Computing," pp. 745-749.