A faster algorithm for the all-pairs shortest path problem and its application

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3106, Issue , 2004, Pages 278-289

  Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

ALL PAIRS SHORTEST PATHS; DISTANCE MATRIX MULTIPLICATION; ITS APPLICATIONS; MAXIMUM SUBARRAY PROBLEMS; RAM MODEL; SPEED UP; TIME COMPLEXITY;

ALGORITHMS;

EID: 26844521960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_31     Document Type: Article

References (12)

1. Akl, S, The design and analysis of parallel algorithms, Prentice-Hall, 1989.
2. Alon, N, Galil, and Margalit, On the Exponent of the All Pairs Shortest Path Problem, Jour. Comp. Sys. Sci., vol 54, no. 2, pp 255-262, 1997
3. Bentley, J., Programming Pearls - Perspective on Performance, Comm. ACM, 27 (1984) 1087-1092
4. Fredman, M, New bounds on the complexity of the shortest path problem, SIAM Jour. Computing, vol. 5, pp 83-89, 1976
5. Han, Y, Pan, V. Y., and Reif, J. H., Efficient parallel algorithms for computing all pair shortest paths in directed graphs, Algorithmica, vol 17, pp 399-415, 1997
6. Horowitz, E, Sahni, S, Rajasekaran, S, Computer Algorithms, Computer Science Press, 1998.
7. 2 log n) expected time, SIAM Jour. Computing, (1987)
8. Takaoka, T., A New Upper Bound on the complexity of the all pairs shortest path problem, Info. Proc. Lett., 43 (1992) 195-199
9. Takaoka, T, Subcubic algorithms for the all pairs shortest path problem, Algorithmica, vol. 20, 309-318, 1998
10. Takaoka, T, Subcubic algorithms for the maximum subarray probelm, Proc. Computing:Australasian Theory Symposium (CATS 2002), pp 189-198, 2002.
11. Tamaki, H. and T. Tokuyama, Algorithms for the Maximum Subarray Problem Based on Matrix Multiplicarion, Proceedings of the 9th SODA (Symposium on Discrete Algorithms), (1998) 446-452
12. Zwick, U, All pairs shortest paths in weighted directed graphs - exact and almost exact algorithms, 39th FOCS, pp 310-319, 1998.