A note of an O (n3 / log n) time algorithm for all pairs shortest paths

Information Processing Letters

Volumn 105, Issue 3, 2008, Pages 114-116

  Han, Yijie ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Analysis of algorithms; Complexity; Graph algorithms; Shortest path

Indexed keywords

COMPUTATIONAL COMPLEXITY; NUMERICAL METHODS;

GRAPH ALGORITHMS; SHORTEST PATH;

ALGORITHMS;

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

References (16)

1. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley, Reading, MA
2. Aho A.V., Hopcroft J.E., and Ullman J.D. Data Structures and Algorithms (1983), Addison-Wesley, Reading, MA
3. 3 / log n) time. Proc. 9th Workshop Algorithms Data Structures. Lecture Notes in Computer Science vol. 3608 (2005), Springer, Berlin 318-324
4. Dobosiewicz W. A more efficient algorithm for min-plus multiplication. Inter. J. Comput. Math. 32 (1990) 49-60
5. Fredman M.L. New bounds on the complexity of the shortest path problem. SIAM J. Computing 5 (1976) 83-89
6. Fredman M.L., and Tarjan R. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34 (1987) 596-615
7. Galil Z., and Margalit O. All pairs shortest distances for graphs with small integer length edges. Inform. Comput. 134 (1997) 103-139
8. Han Y. Improved algorithms for all pairs shortest paths. Inform. Process. Lett. 91 (2004) 245-250
9. 5 / 4) time algorithm for all pairs shortest paths. Proc. 14th Annual European Symposium on Algorithms (ESA'06). Lecture Notes in Computer Science vol. 4168 (2006), Springer, Berlin 411-417
10. 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 Computer Science vol. 2380 (2002), Springer, Berlin 85-97
11. Seidel R. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci. 51 (1995) 400-403
12. Takaoka T. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett. 43 (1992) 195-199
13. 3 log log n / log n) time algorithm for the all-pairs shortest path problem. Inform. Process. Lett. 96 (2005) 155-161
14. M. Thorup, Undirected single source shortest paths in linear time, in: Proc. 38th IEEE Symposium on Foundations of Computer Science, Miami Beach, Florida, 1997, pp. 12-21
15. U. Zwick, All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms, in: Proc. 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, California, 1998, pp. 310-319
16. Zwick U. A slightly improved sub-cubic algorithm for the all pairs shortest paths problem. Proceedings of ISAAC 2004. Lecture Notes in Computer Science vol. 3341 (2004), Springer, Berlin 921-932