All-pairs shortest paths with real weights in O(n3/log n) time

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 318-324

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; GRAPHIC METHODS; MATHEMATICAL MODELS;

REAL-WEIGHTED DIRECTED GRAPHS; SUBCUBIC ALGORITHMS;

ALGORITHMS;

EID: 26844516090     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_28     Document Type: Conference Paper

References (23)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. J. Comput. Sys. Sci., 54:255-262, 1997.
3. V. L. Arlazarov, E. C. Dinic, M. A. Kronrod, and I. A. Faradzev. On economical construction of the transitive closure of a directed graph. Soviet Math. Dokl., 11:1209-1210, 1970.
4. A. L. Buchsbaum, H. Kaplan, A. Rogers, and J. R. Westbrook. Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators. In Proc. 30th ACM Sympos. Theory Comput., pages 279-288, 1998.
5. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9:251-280, 1990.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. McGraw-Hill, 2nd ed., 2001.
7. W. Dobosiewicz. A more efficient algorithm for the min-plus multiplication. Int. J. Computer Math., 32:49-60, 1990.
8. D. Eppstein. Quasiconvex analysis of backtracking algorithms. In Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pages 788-797, 2004.
9. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. J. Comput. Sys. Sci., 51:261-272, 1995.
10. M. L. Fredman. New bounds on the complexity of the shortest path problem. SIAM J. Comput., 5:49-60, 1976.
11. Z. Galil and O. Margalit. All pairs shortest paths for graphs with small integer length edges. J. Comput. Sys. Sci., 54:243-254, 1997.
12. Y. Han. Improved algorithm for all pairs shortest paths. Inform. Process. Lett., 91:245-250, 2004.
13. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoret. Comput. Sci., 312:47-74, 2004.
14. S. Pettie and V. Ramachandran. A shortest path algorithm for real-weighted undirected graphs. SIAM J. Comput., to appear.
15. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
16. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Sys. Sci., 51:400-403, 1995.
17. A. Shoshan and U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proc. 40th IEEE Sympos. Found. Comput. Sci., pages 605-614, 1999.
18. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
19. T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett., 43:195-199, 1992.
20. T. Takaoka. A faster algorithm for the all-pairs shortest path problem and its application. In Proc. 10th Int. Conf. Comput. Comb., Lect. Notes Comput. Sci., vol. 3106, Springer-Verlag, pages 278-289, 2004.
21. R. Yuster and U. Zwick. Fast sparse matrix multiplication. In Proc. 12th European Sympos. Algorithms, Lect. Notes Comput. Sci., vol. 3221, Springer-Verlag, pages 604-615, 2004.
22. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM, 49:289-317, 2002.
23. U. Zwick. A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. In Proc. 15th Int. Sympos. Algorithms and Computation, Lect. Notes Comput. Sci., vol. 3341, Springer-Verlag, pages 921-932, 2004.