Algorithmica

, Volume 59, Issue 4, pp 621–633

# All-Pairs Bottleneck Paths in Vertex Weighted Graphs

Article

## Abstract

Let G=(V,E,w) be a directed graph, where w:V→ℝ is a weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u,v the capacity from u to v, denoted by c(u,v), is the maximum bottleneck weight of a path from u to v. In the All-Pairs Bottleneck Paths (APBP) problem the task is to find the capacities for all ordered pairs of vertices. Our main result is an O(n2.575) time algorithm for APBP. The exponent is derived from the exponent of fast matrix multiplication.

A variant of our algorithm computes shortest paths of maximum bottleneck weight. Let d(u,v) denote the (unweighted) distance from u to v, and let sc(u,v) denote the maximum bottleneck weight of a path from u to v having length d(u,v). The All-Pairs Bottleneck Shortest Paths (APBSP) problem is to compute sc(u,v) for all ordered pairs of vertices. We present an algorithm for APBSP whose running time is O(n2.86).

### Keywords

Bottleneck paths Shortest paths Directed weighted graphs

## Preview

### References

1. 1.
Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 434–449 (1996)
2. 2.
Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75–94 (2005)
3. 3.
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
4. 4.
Coppersmith, D.: Rectangular matrix multiplication revisited. J. Complex. 13, 42–49 (1997)
5. 5.
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9, 251–280 (1990)
6. 6.
Czumaj, A., Kowaluk, M., Lingas, A.: Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci. 380, 37–46 (2007)
7. 7.
Czumaj, A., Lingas, A.: Finding a heaviest triangle is not harder than matrix multiplication. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 986–994 (2007) Google Scholar
8. 8.
Duan, R., Pettie, S.: Fast algorithms for (Max,Min)-matrix multiplication and bottleneck shortest paths In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 384–391 (2009) Google Scholar
9. 9.
Fischer, M.J., Meyer, A.R.: Boolean matrix multiplication and transitive closure. In: Proceedings of the 12th Symposium on Switching and Automata Theory, East Lansing, MI, pp. 129–131 (1971) Google Scholar
10. 10.
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)
11. 11.
Furman, M.E.: 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(5), 1252 (1970)
12. 12.
Galil, Z., Margalit, O.: Witnesses for Boolean matrix multiplication and for transitive closure. J. Complex. 9(2), 201–221 (1993)
13. 13.
Gabow, H.N., Tarjan, R.E.: Algorithms for two bottleneck optimization problems. J. Algorithms 9(3), 411–417 (1988)
14. 14.
Huang, X., Pan, V.Y.: Fast rectangular matrix multiplications and applications. J. Complex. 14, 257–299 (1998)
15. 15.
Kowaluk, M., Lingas, A.: LCA queries in directed acyclic graphs. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3580, pp. 241–248. Springer, Berlin (2005)
16. 16.
Munro, I.: Efficient determination of the strongly connected components and the transitive closure of a graph. Unpublished manuscript, Univ. of Toronto, Toronto, Canada (1971) Google Scholar
17. 17.
Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389–1401 (1957) Google Scholar
18. 18.
Seidel, R.: On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci. 51(3), 400–403 (1995)
19. 19.
Vassilevska, V., Williams, R.: Finding a maximum weight triangle in n 3−δ time, with applications. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 225–231 (2006) Google Scholar
20. 20.
Vassilevska, V., Williams, R., Yuster, R.: Finding the smallest H-subgraph in real weighted graphs and related problems. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 4051, pp. 262–273. Springer, Berlin (2006)
21. 21.
Vassilevska, V., Williams, R., Yuster, R.: All-pairs bottleneck paths in truly sub-cubic time. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 585–589 (2007) Google Scholar
22. 22.
Zwick, U.: All pairs lightest shortest paths. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 61–69 (1999) Google Scholar
23. 23.
Zwick, U.: Exact approximate distances in graphs—a survey. In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 2161, pp. 33–48. Springer, Berlin (2001) Google Scholar
24. 24.
Zwick, U.: All-pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49, 289–317 (2002)