Improved algorithm for all pairs shortest paths

Information Processing Letters

Volumn 91, Issue 5, 2004, Pages 245-250

  Han, Yijie ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Algorithms; Complexity; Graph algorithms; Shortest path

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; ENCODING (SYMBOLS); FORMAL LOGIC; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; RANDOM ACCESS STORAGE;

COMPLEXITY; GRAPH ALGORITHMS; MATRIX MULTIPLICATION; SHORTEST PATH;

DATA PROCESSING;

EID: 3242702293     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.05.006     Document Type: Article

References (11)

1. Aho A.V., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading, MA.
2. Aho A.V., Hopcroft J.E., Ullman J.D. Data Structures and Algorithms. 1983;Addison-Wesley, Reading, MA.
3. Dobosiewicz W. A more efficient algorithm for min-plus multiplication. Internat. J. Comput. Math. 32:1990;49-60.
4. Fredman M.L. New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5:1976;83-89.
5. Fredman M.L., Tarjan R. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM. 34:1987;596-615.
6. Galil Z., Margalit O. All pairs shortest distances for graphs with small integer length edges. Inform. and Comput. 134:1997;103-139.
7. Pettie S. A faster all-pairs shortest path algorithm for real-weighted sparse graphs. Proceedings of 29th International Colloquium on Automata, Languages, and Programming (ICALP'02). Lecture Notes in Comput. Sci. vol. 2380:2002;85-97 Springer-Verlag, Berlin.
8. Seidel R. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. System Sci. 51:1995;400-403.
9. Takaoka T. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett. 43:1992;195-199.
10. Thorup M. Undirected single source shortest paths in linear time. Proc. 38th IEEE Symposium on Foundations of Computer Science, Miami Beach, FL. 1997;12-21.
11. Zwick U. All pairs shortest paths in weighted directed graphs - exact and almost exact algorithms. Proc. 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA. 1998;310-319.