Computing Exact Minimum Cuts Without Knowing the Graph

We give query-efficient algorithms for the global min-cut and the s-t cut problem in unweighted, undirected graphs. Our oracle model is inspired by the submodular function minimization problem: on query $S \subset V$, the oracle returns the size of the cut between $S$ and $V \setminus S$. We provide algorithms computing an exact minimum $s$-$t$ cut in $G$ with $\tilde{O}(n^{5/3})$ queries, and computing an exact global minimum cut of $G$ with only $\tilde{O}(n)$ queries (while learning the graph requires $\tilde{\Theta}(n^2)$ queries).

[1]  Evangelos Kranakis,et al.  Reconstructing Cactus Graphs from Shortest Path Information - (Extended Abstract) , 2016, AAIM.

[2]  Andreas Krause,et al.  Efficient Minimization of Decomposable Submodular Functions , 2010, NIPS.

[3]  Fabian Kuhn,et al.  On the power of the congested clique model , 2014, PODC.

[4]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[5]  Vijay V. Vazirani,et al.  Representing and Enumerating Edge Connectivity Cuts in RNC , 1991, WADS.

[6]  Nicholas J. A. Harvey.  Matroid intersection, pointer chasing, and Young's seminormal representation of Sn , 2008, SODA '08.

[7]  Michael I. Jordan,et al.  On the Convergence Rate of Decomposable Submodular Function Minimization , 2014, NIPS.

[8]  Claire Mathieu,et al.  Near-Linear Query Complexity for Graph Inference , 2015, ICALP.

[9]  David P. Woodruff,et al.  On Sketching Quadratic Forms , 2015, ITCS.

[10]  Claire Mathieu,et al.  Graph Reconstruction via Distance Oracles , 2013, ICALP.

[11]  Ken-ichi Kawarabayashi,et al.  Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time , 2014, STOC.

[12]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[13]  Wolfgang Maass,et al.  On the communication complexity of graph properties , 1988, STOC '88.

[14]  David R. Karger,et al.  Fast Augmenting Paths by Random Sampling from Residual Graphs , 2015, SIAM J. Comput..

[15]  Hanna Mazzawi.  Optimally reconstructing weighted graphs using queries , 2010, SODA '10.

[16]  Yin Tat Lee,et al.  A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[17]  Sudipto Guha,et al.  Analyzing graph structure via linear measurements , 2012, SODA.

[18]  Robert Krauthgamer,et al.  Sketching Cuts in Graphs and Hypergraphs , 2014, ITCS.

[19]  Nader H. Bshouty,et al.  Reconstructing Weighted Graphs with Minimal Query Complexity , 2009, ALT.

[20]  Jeong Han Kim,et al.  Optimal query complexity bounds for finding graphs , 2010, Artif. Intell..

[21]  藤重 悟.  Submodular functions and optimization , 1991 .

[22]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[23]  David R. Karger,et al.  A new approach to the minimum cut problem , 1996, JACM.

[24]  Boaz Patt-Shamir,et al.  Sparse Reliable Graph Backbones , 2010, ICALP.

[25]  David R. Karger,et al.  Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs , 2002, SIAM J. Comput..

[26]  Jorge Urrutia,et al.  Implicit Routing and Shortest Path Information (Extended Abstract) , 1995, Colloquium on Structural Information & Communication Complexity.