All Pairs Shortest Paths for Graphs with Small Integer Length Edges

Journal of Computer and System Sciences

Volumn 54, Issue 2, 1997, Pages 243-254

  Galil, Zvi ^a,b   Margalit, Oded ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING;

ALL PAIRS SHORTEST DISTANCES (APSD); ALL PAIRS SHORTEST PATHS (APSP);

ALGORITHMS;

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

References (5)

1. N. Alon, Z. Galil and O. Margalit, On the exponent of all pairs shortest path problem in "Proceedings, 32th Annual Symp. on Foundation of Comput. Sci., 1991," pp. 569-575; (a full version is to appear in J. Comput. System Sci.
2. Z. Galil and O. Margalit, All pairs shortest distances for graphs with small integer edge lengths, manuscript.
3. N. Alon, Z. Galil, O. Margalit, and M. Naor, Witnesses for Boolean matrix multiplication and for shortest paths, in "Proceedings, 33rd Annual Symp. on Foundation of Comput. Sci. 1992," pp. 417-426.
4. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, in "Proceedings, 19th Annual Symp. on Theory of Computing, 1987," pp. 1-6.
5. R. Seidel, On the all-pairs-shortest-path, problem, in "Proceedings, 24th Annual Symp. on Theory of Computing, 1992," pp. 745-749.