2000 character limit reached
Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries (2410.18704v1)
Published 24 Oct 2024 in cs.DS
Abstract: We give the first deterministic algorithm that makes sub-quadratic queries to find the global min-cut of a simple graph in the cut query model. Given an $n$-vertex graph $G$, our algorithm makes $\widetilde{O}(n{5/3})$ queries to compute the global min-cut in $G$. As a key ingredient, we also show an algorithm for finding $s$-$t$ max-flows of size $\widetilde{O}(n)$ in $\widetilde{O}(n{5/3})$ queries. We also show efficient cut-query implementations of versions of expander decomposition and isolating cuts, which may be of independent interest.
- A sublinear time quantum algorithm for st minimum cut on dense simple graphs. arXiv preprint arXiv:2110.15587, 2021.
- Parallel minimum cuts in o (m log2 n) work and low depth. ACM Transactions on Parallel Computing, 10(4):1–28, 2023.
- Graph connectivity and single element recovery via linear and or queries. In 29th Annual European Symposium on Algorithms (ESA 2021). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2021.
- A simple semi-streaming algorithm for global minimum cuts. In Symposium on Simplicity in Algorithms (SOSA), pages 172–180. SIAM, 2021.
- Cut query algorithms with star contraction. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 507–518. IEEE, 2022.
- On the query complexity of connectivity with global queries. arXiv preprint arXiv:2109.02115, 2021.
- Expander flows, geometric embeddings and graph partitioning. Journal of the ACM (JACM), 56(2):1–37, 2009.
- Complexity classes in communication complexity theory. In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pages 337–347. IEEE, 1986.
- Edge estimation with independent set oracles. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
- Distributed weighted min-cut in nearly-optimal time. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1144–1153, 2021.
- Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 343–354, 2019.
- Yefim Dinitz. Dinitz’algorithm: The original version and even’s version. In Theoretical Computer Science: Essays in Memory of Shimon Even, pages 218–240. Springer, 2006.
- Harold N Gabow. A matroid approach to finding edge connectivity and packing arborescences. In Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 112–122, 1991.
- Parallel minimum cuts in near-linear work and low depth. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, pages 1–11, 2018.
- Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4):551–570, 1961.
- Fully dynamic exact edge connectivity in sublinear time. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 70–86. SIAM, 2023.
- Optimal reconstruction of graphs under the additive model. Algorithmica, 28:104–124, 2000.
- Universally-optimal distributed exact min-cut. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pages 281–291, 2022.
- Nicholas James Alexander Harvey. Matchings, matroids and submodular functions. PhD thesis, Massachusetts Institute of Technology, 2008.
- Deterministic near-linear time minimum cut in weighted graphs. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3089–3139. SIAM, 2024.
- On the communication complexity of graph properties. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 186–191, 1988.
- JX Hao and James B Orlin. A faster algorithm for finding the minimum cut in a directed graph. Journal of Algorithms, 17(3):424–446, 1994.
- Local flow partitioning for faster edge connectivity. SIAM Journal on Computing, 49(1):1–36, 2020.
- Fully dynamic min-cut of superconstant size in subpolynomial time. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2999–3026. SIAM, 2024.
- David R Karger. Random sampling in cut, flow, and network design problems. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pages 648–657, 1994.
- David R Karger. Minimum cuts in near-linear time. Journal of the ACM (JACM), 47(1):46–76, 2000.
- On a cut-matching game for the sparsest cut problem. Univ. California, Berkeley, CA, USA, Tech. Rep. UCB/EECS-2007-177, 6(7):12, 2007.
- Finding maximum flows in undirected graphs seems easier than bipartite matching. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 69–78, 1998.
- Derandomization through approximation: An nc algorithm for minimum cuts. In Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, pages 497–506, 1994.
- A new approach to the minimum cut problem. Journal of the ACM (JACM), 43(4):601–640, 1996.
- Deterministic edge connectivity in near-linear time. Journal of the ACM (JACM), 66(1):1–50, 2018.
- Learning spanning forests optimally in weighted undirected graphs with cut queries. In International Conference on Algorithmic Learning Theory, pages 785–807. PMLR, 2024.
- Jason Li. Deterministic mincut in almost-linear time. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 384–395, 2021.
- Deterministic min-cut in poly-logarithmic max-flows. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 85–92. IEEE, 2020.
- Weighted min-cut: sequential, cut-query, and streaming algorithms. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 496–509, 2020.
- A linear-time algorithm for finding a sparse k-connected spanning subgraph of ak-connected graph. Algorithmica, 7(1):583–596, 1992.
- On the “log rank”-conjecture in communication complexity. Combinatorica, 15:567–588, 1995.
- Computing exact minimum cuts without knowing the graph. In 9th Innovations in Theoretical Computer Science Conference (ITCS), 2018.
- Vector-matrix-vector queries for solving linear algebra, statistics, and graph problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020.
- Thatchaphol Saranurak and Di Wang. Expander decomposition and pruning: Faster, stronger, and simpler. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2616–2635. SIAM, 2019.
- Mikkel Thorup. Fully-dynamic min-cut. Combinatorica, 27(1):91–127, 2007.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.