All-Pairs Bottleneck Paths in vertex weighted graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 978-985

  Shapira, Asaf ^a   Yuster, Raphael ^b   Zwick, Uri ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIRECTED GRAPHS; MATRIX ALGEBRA;

ALL PAIRS SHORTEST PATHS; ARBITRARY WEIGHT FUNCTION; BOOLEAN MATRIX MULTIPLICATION; BOTTLENECK PATHS; BOTTLENECK SHORTEST PATH; FAST MATRIX MULTIPLICATION; LEAST COMMON ANCESTORS; UNIFORM FRAMEWORK;

GRAPH THEORY;

EID: 70349148844     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974.
2. N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16:434-449, 1996.
3. M.A. Bender, M. Farach-Colton, G. Pemmasani, S. Skiena, and P. Sumazin. Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms, 57(2):75-94, 2005. Also, Proc. of SODA 2001.
4. 3/log n) Time. In Proc. of the 9th WADS, Lecture Notes in Computer Science 3608, Springer (2005), 318-324.
5. D. Coppersmith. Rectangular matrix multiplication revisited. Journal of Complexity, 13:42-49, 1997.
6. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbol. Comput., 9:251-280, 1990.
7. M.J. Fischer and A.R. Meyer. Boolean matrix multiplication and transitive closure. In Proc. of the 12th Symposium on Switching and Automata Theory, East Lansing, Mich., (1971), 129-131.
8. M.L. Fredman and R.E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
9. M.E. Furman. Application of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph. Dokl. Akad. Nauk SSSR, 11 (1970), no. 5, p. 1252.
10. Z. Galil and O. Margalit. Witnesses for Boolean matrix multiplication and for transitive closure. Journal of Complexity, 9(2):201-221, 1993.
11. H.N. Gabow and R.E. Tarjan. Algorithms for two bottleneck optimization problems. Journal of Algorithms, 9(3):411-417, 1988.
12. X. Huang and V.Y. Pan. Fast rectangular matrix multiplications and applications. Journal of Complexity, 14:257-299, 1998.
13. M. Kowaluk and A. Lingas. LCA Queries in Directed Acyclic Graphs. In Proc. of the 32nd ICALP, Lecture Notes in Computer Science 3580, Springer (2005), 241-248.
14. A. Czumaj, M. Kowaluk and A. Lingas. Faster algorithms for finding lowest common ancestors in directed acyclic graphs, Theoretical Computer Science, to appear.
15. I. Munro. Efficient determination of the strongly connected components and the transitive closure of a graph. Unpublished manuscript, Univ. of Toronto, Toronto, Canada, 1971.
16. R.C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
17. R. Seidel. On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. J. Comput. Syst. Sci., 51(3):400-403, 1995.
18. 3-δ time, with applications. In Proc. of the 38th STOC, 225-231, 2006.
19. V. Vassilevska, R. Williams, and R. Yuster. Finding the smallest H-subgraph in real weighted graphs and related problems. In Proc. of the 33rd ICALP, Lecture Notes in Computer Science, Springer (2006), 262-273.
20. U. Zwick. All Pairs Lightest Shortest Paths. In Proc. of the 31st STOC, 61-69, 1999.
21. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49:289-317, 2002.