An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem

Information Processing Letters

Volumn 96, Issue 5, 2005, Pages 155-161

  Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Divide and conquer; Graph algorithms; Shortest path

Indexed keywords

ALGORITHMS; GRAPHIC METHODS;

GRAPH ALGORITHMS; RAM MODEL;

INFORMATION ANALYSIS;

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

References (11)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Reading, MA
2. N. Alon, Galil, and O. Margalit On the exponent of the all pairs shortest path problem J. Comput. System Sci. 54 2 1997 255 262
3. V.L. Arlazarov, E.C. Dinic, M.A. Kronrod, and I.A. Faradev On economical construction of the transitive closure of a directed graph Soviet Math. Dokl. 11 1970 1209 1210
4. Dobosiewicz A more efficient algorithm for min-plus multiplication Internat. J. Comput. Math. 32 1990 49 60
5. M. Fredman New bounds on the complexity of the shortest path problem SIAM J. Comput. 5 1976 83 89
6. Y. Han Improved algorithms for all pairs shortest paths Inform. Process. Lett. 91 2004 245 250
7. T. Takaoka A New upper bound on the complexity of the all pairs shortest path problem Inform. Process. Lett. 43 1992 195 199
8. T. Takaoka Subcubic algorithms for the all pairs shortest path problem Algorithmica 20 1998 309 318
9. T. Takaoka A faster algorithm for the all pairs shortest path problem and its application COCOON 2004 Lecture Notes in Comput. Sci. vol. 3106 2004 Springer Berlin 278 280
10. U. Zwick, All pairs shortest paths in weighted directed graphs - exact and almost exact algorithms, in: 39th FOCS, 1998, pp. 310-319
11. U. Zwick A slightly improved sub-cubic algorithm for the all pairs shortest paths problem ISAAC 2004 Lecture Notes in Comput. Sci. vol. 3341 2004 Springer Berlin 921 932