Random walks and forbidden minors III: poly(d/{\epsilon})-time partition oracles for minor-free graph classes

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, for a sufficiently small ε > 0, one removes εdn edges to get connected components of size independent of n. An important tool for sublinear algorithms and property testing for such classes is the partition oracle, introduced by the seminal work of Hassidim-Kelner-Nguyen-Onak (FOCS 2009). A partition oracle is a local procedure that gives consistent access to a hyperfinite decomposition, without any preprocessing. Given a query vertex v, the partition oracle outputs the component containing v in time independent of n. All the answers are consistent with a single hyperfinite decomposition. The partition oracle of Hassidim et al. runs in time d ) per query. They pose the open problem of whether poly(dε−1)-time partition oracles exist. Levi-Ron (ICALP 2013) give a refinement of the previous approach, to get a partition oracle that runs in time d −1)-per query. In this paper, we resolve this open problem and give poly(dε−1)-time partition oracles for bounded degree graphs in any minor-closed family. Unlike the previous line of work based on combinatorial methods, we employ techniques from spectral graph theory. We build on a recent spectral graph theoretical toolkit for minor-closed graph families, introduced by the authors to develop efficient property testers. A consequence of our result is a poly(dε−1)-query tester for any monotone and additive property of minor-closed families (such as bipartite planar graphs). Our result also gives poly(dε−1)-query algorithms for additive εn-approximations for problems such as maximum matching, minimum vertex cover, maximum independent set, and minimum dominating set for these graph families. Department of Computer Science, EPFL. akash.kumar@epfl.ch Department of Computer Science, University of California, Santa Cruz. sesh@ucsc.edu Department of Computer Science, University of California, Santa Cruz. astolman@ucsc.edu CS and AS acknowledge the support of NSF grants CCF-1740850, CCF-1813165, CCF-1909790, CCF-2023495, and ARO Award W911NF1910294.

[1]  Paul D. Seymour,et al.  Graph Minors .XII. Distance on a Surface , 1995, J. Comb. Theory, Ser. B.

[2]  Dana Ron,et al.  A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor , 2013, ICALP.

[3]  Akash Kumar,et al.  Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[4]  Krzysztof Onak,et al.  Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Christian Sohler,et al.  Every property of hyperfinite graphs is testable , 2011, STOC '11.

[6]  C. Kuratowski.  Sur le problème des courbes gauches en Topologie , 1930 .

[7]  Dana Ron,et al.  Finding cycles and trees in sublinear time , 2010, Random Struct. Algorithms.

[8]  Oded Schramm,et al.  Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..

[9]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[10]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[11]  N. Alon,et al.  A separator theorem for nonplanar graphs , 1990 .

[12]  Yuichi Yoshida,et al.  Testing Outerplanarity of Bounded Degree Graphs , 2014, Algorithmica.

[13]  K. Wagner.  Über eine Eigenschaft der ebenen Komplexe , 1937 .

[14]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

[15]  Robin Thomas,et al.  Planar Separators , 1994, SIAM J. Discret. Math..

[16]  Artur Czumaj,et al.  Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs , 2009, SIAM J. Comput..

[17]  Miklós Simonovits,et al.  The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[18]  Shang-Hua Teng,et al.  A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning , 2008, SIAM J. Comput..

[19]  Oded Goldreich,et al.  Introduction to Property Testing , 2017 .

[20]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[21]  Krzysztof Onak,et al.  An Efficient Partitioning Oracle for Bounded-Treewidth Graphs , 2011, APPROX-RANDOM.

[22]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[23]  Reut Levi,et al.  On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error , 2017, ArXiv.

[24]  Alessandro Panconesi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .