Document

# Query Complexity of Global Minimum Cut

## File

LIPIcs.APPROX-RANDOM.2021.6.pdf
• Filesize: 0.79 MB
• 15 pages

## Cite As

Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar. Query Complexity of Global Minimum Cut. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.6

## Abstract

In this work, we resolve the query complexity of global minimum cut problem for a graph by designing a randomized algorithm for approximating the size of minimum cut in a graph, where the graph can be accessed through local queries like Degree, Neighbor, and Adjacency queries. Given ε ∈ (0,1), the algorithm with high probability outputs an estimate t̂ satisfying the following (1-ε) t ≤ t̂ ≤ (1+ε) t, where t is the size of minimum cut in the graph. The expected number of local queries used by our algorithm is min{m+n,m/t}poly(log n,1/(ε)) where n and m are the number of vertices and edges in the graph, respectively. Eden and Rosenbaum showed that Ω(m/t) local queries are required for approximating the size of minimum cut in graphs, {but no local query based algorithm was known. Our algorithmic result coupled with the lower bound of Eden and Rosenbaum [APPROX 2018] resolve the query complexity of the problem of estimating the size of minimum cut in graphs using local queries.} Building on the lower bound of Eden and Rosenbaum, we show that, for all t ∈ ℕ, Ω(m) local queries are required to decide if the size of the minimum cut in the graph is t or t-2. Also, we show that, for any t ∈ ℕ, Ω(m) local queries are required to find all the minimum cut edges even if it is promised that the input graph has a minimum cut of size t. Both of our lower bound results are randomized, and hold even if we can make Random Edge queries in addition to local queries.

## Subject Classification

##### ACM Subject Classification
• Mathematics of computing → Probabilistic algorithms
• Theory of computation → Streaming, sublinear and near linear time algorithms
##### Keywords
• Query complexity
• Global mincut

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. K. J. Ahn, S. Guha, and A. McGregor. Graph Sketches: Sparsification, Spanners, and Subgraphs. In Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS, pages 5-14, 2012.
2. M. Aliakbarpour, A. S. Biswas, T. Gouleakis, J. Peebles, R. Rubinfeld, and A. Yodpinyanee. Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. Algorithmica, 80(2):668-697, 2018.
3. S. Assadi, M. Kapralov, and S. Khanna. A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. In Proceedings of the 9th Innovations in Theoretical Computer Science Conference, ITCS, pages 6:1-6:20, 2019.
4. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory (preliminary version). In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, FOCS, pages 337-347, 1986.
5. E. Blais, J. Brody, and K. Matulef. Property Testing Lower Bounds via Communication Complexity. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC, pages 210-220, 2011.
6. D. P. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 1st edition, 2009.
7. T. Eden, A. Levi, D. Ron, and C. Seshadhri. Approximately Counting Triangles in Sublinear Time. SIAM J. Comput., 46(5):1603-1646, 2017.
8. T. Eden, D. Ron, and C. Seshadhri. On Approximating the Number of k-Cliques in Sublinear Time. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC, pages 722-734, 2018.
9. T. Eden and W. Rosenbaum. Lower Bounds for Approximating Graph Parameters via Communication Complexity. In Proceedings of the 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, pages 11:1-11:18, 2018.
10. T. Eden and W. Rosenbaum. On Sampling Edges Almost Uniformly. In Proceedings of the 1st Symposium on Simplicity in Algorithms, SOSA, pages 7:1-7:9, 2018.
11. U. Feige. On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph. SIAM J. Comput., 35(4):964-984, 2006.
12. M. Ghaffari and B. Haeupler. Distributed algorithms for planar networks II: low-congestion shortcuts, mst, and min-cut. In Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 202-219. SIAM, 2016.
13. M. Ghaffari and F. Kuhn. Distributed minimum cut approximation. In Distributed Computing, volume 8205 of Lecture Notes in Computer Science, pages 1-15, 2013.
14. M. Ghaffari and K. Nowicki. Massively parallel algorithms for minimum cut. In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 119-128. ACM, 2020.
15. O. Goldreich. Introduction to Property Testing. Cambridge University Press, 2017.
16. O. Goldreich, S. Goldwasser, and D. Ron. Property Testing and its Connection to Learning and Approximation. J. ACM, 45(4):653-750, 1998.
17. O. Goldreich and D. Ron. Approximating Average Parameters of Graphs. Random Structures & Algorithms, 32(4):473-493, 2008.
18. M. Gonen, D. Ron, and Y. Shavitt. Counting Stars and Other Small Subgraphs in Sublinear-Time. SIAM Journal on Discrete Mathematics, 25(3):1365-1411, 2011.
19. A. Graur, T. Pollner, V. Ramaswamy, and S. M. Weinberg. New Query Lower Bounds for Submodular Function Minimization. In Proceedings of the 11th Innovations in Theoretical Computer Science Conference, ITCS, volume 151, pages 64:1-64:16, 2020.
20. A. Hajnal, W. Maass, and G. Turán. On the communication complexity of graph properties. In Janos Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC, pages 186-191, 1988.
21. M. Kapralov, Y. T. Lee, C. Musco, C. Musco, and A. Sidford. Single pass spectral sparsification in dynamic streams. In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS, pages 561-570, 2014.
22. D. R. Karger. Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. In Proceedings of the 4th Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, SODA, pages 21-30, 1993.
23. D. R. Karger and C. Stein. An 𝒪̃(n²) Algorithm for Minimum Cuts. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC, pages 757-765, 1993.
24. T. Kaufman, M. Krivelevich, and D. Ron. Tight Bounds for Testing Bipartiteness in General Graphs. SIAM J. Comput., 33(6):1441-1483, 2004.
25. K. Kawarabayashi and M. Thorup. Deterministic edge connectivity in near-linear time. J. ACM, 66(1):4:1-4:50, 2019.
26. E. Kushilevitz. Communication complexity. In Advances in Computers, volume 44, pages 331-360. Elsevier, 1997.
27. A. McGregor. Graph Stream Algorithms: A Survey. SIGMOD Rec., 43(1):9-20, 2014.
28. S. Mukhopadhyay and D. Nanongkai. Weighted Min-Cut: Sequential, Cut-Query, and Streaming Algorithms. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC, pages 496-509, 2020.
29. A. Rubinstein, T. Schramm, and S. M. Weinberg. Computing Exact Minimum Cuts Without Knowing the Graph. In Proceedings of the 9th Innovations in Theoretical Computer Science Conference, ITCS, pages 39:1-39:16, 2018.