An Enumerative Perspective on Connectivity (2310.12889v4)
Abstract: Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph $G$ with vertices $s$ and $t$, the connectivity $\lambda(s,t)$ from $s$ to $t$ is defined to be the maximum number of edge-disjoint paths from $s$ to $t$ in $G$. Much research has gone into designing fast algorithms for computing connectivities in graphs. Previous work showed that it is possible to compute connectivities for all pairs of vertices in directed graphs with $m$ edges in $\tilde{O}(m\omega)$ time [Chueng, Lau, and Leung, FOCS 2011], where $\omega \in [2,2.3716)$ is the exponent of matrix multiplication. For the related problem of computing "small connectivities," it was recently shown that for any positive integer $k$, we can compute $\min(k,\lambda(s,t))$ for all pairs of vertices $(s,t)$ in a directed graph with $n$ nodes in $\tilde{O}((kn)\omega)$ time [Akmal and Jin, ICALP 2023]. In this paper, we present an alternate exposition of these $\tilde{O}(m\omega)$ and $\tilde{O}((kn)\omega)$ time algorithms, with simpler proofs of correctness. Earlier proofs were somewhat indirect, introducing an elegant but ad hoc "flow vector framework" for showing correctness of these algorithms. In contrast, we observe that these algorithms for computing exact and small connectivity values can be interpreted as testing whether certain generating functions enumerating families of edge-disjoint paths are nonzero. This new perspective yields more transparent proofs, and ties the approach for these problems more closely to the literature surrounding algebraic graph algorithms.
- Improved merlin–arthur protocols for central problems in fine-grained complexity. Algorithmica, 85(8):2395–2426, February 2023.
- Faster algorithms for all-pairs bounded min-cuts, 2018.
- Shyan Akmal and Ce Jin. An efficient algorithm for all-pairs bounded edge connectivity, 2023.
- Breaking the cubic barrier for all-pairs max-flow: Gomory-hu tree in nearly quadratic time, 2021.
- Proofs from THE BOOK. Springer Berlin Heidelberg, 2018.
- Maximum flow and minimum-cost flow in almost-linear time, 2022.
- Graph connectivities, network coding, and expander graphs. SIAM Journal on Computing, 42(3):733–751, January 2013.
- Radu Curticapean. Determinants from homomorphisms, 2022.
- On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science, 326(1-3):57–67, October 2004.
- Determinantal sieving, 2023.
- Tight conditional lower bounds for vertex connectivity problems, 2022.
- A generalization of the fast LUP matrix decomposition algorithm and applications. Journal of Algorithms, 3(1):45–56, March 1982.
- Randomized Algorithms. Cambridge University Press, August 1995.
- Meena Mahajan and V. Vinay. Determinant: Combinatorics, algorithms, and complexity. Chicago Journal of Theoretical Computer Science, 1997.
- MIT 6.890 lecture notes: Lecture 1. https://people.csail.mit.edu/virgi/6.890/lecture1.pdf, September 2021.
- Ohad Trabelsi. (almost) ruling out seth lower bounds for all-pairs max-flow, 2023.
- New bounds for matrix multiplication: from alpha to omega, 2023.
- Doron Zeilberger. A combinatorial approach to matrix algebra. Discrete Mathematics, 56(1):61–72, September 1985.