A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor

Motivated by the problem of testing planarity and related properties, we study the problem of designing efficient partition oracles. A partition oracle is a procedure that, given access to the incidence lists representation of a bounded-degree graph G= (V,E) and a parameter ε, when queried on a vertex v ∈ V, returns the part (subset of vertices) that v belongs to in a partition of all graph vertices. The partition should be such that all parts are small, each part is connected, and if the graph has certain properties, the total number of edges between parts is at most ε |V|. In this work, we give a partition oracle for graphs with excluded minors whose query complexity is quasi-polynomial in 1/ε, improving on the result of Hassidim et al. (Proceedings of FOCS 2009), who gave a partition oracle with query complexity exponential in 1/ε. This improvement implies corresponding improvements in the complexity of testing planarity and other properties that are characterized by excluded minors as well as sublinear-time approximation algorithms that work under the promise that the graph has an excluded minor.

[1]  Wei-Kuan Shih,et al.  A New Planarity Test , 1999, Theor. Comput. Sci..

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

[3]  W. Mader.  Homomorphieeigenschaften und mittlere Kantendichte von Graphen , 1967 .

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

[5]  Gábor Elek,et al.  Parameter testing in bounded degree graphs of subexponential growth , 2007, Random Struct. Algorithms.

[6]  Krzysztof Onak.  On the Complexity of Learning and Testing Hypernite Graphs , 2012 .

[7]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[8]  W. B.,et al.  (1) Proceedings of the London Mathematical Society (2) Journal of the London Mathematical Society , 1927, Nature.

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

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

[11]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

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

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

[14]  Krzysztof Onak,et al.  New sublinear methods in the struggle against classical problems , 2010 .

[15]  Seth Pettie,et al.  Randomized minimum spanning tree algorithms using exponentially fewer random bits , 2008, TALG.

[16]  G. Elek.  The combinatorial cost , 2006, math/0608474.

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

[18]  Gabor Elek,et al.  L2-spectral invariants and convergent sequences of finite graphs , 2007, 0709.1261.

[19]  Kazuoki Azuma.  WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[20]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

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

[22]  B. Mohar,et al.  Graph Minors , 2009 .

[23]  Robert E. Tarjan,et al.  Computing an st -Numbering , 1976, Theor. Comput. Sci..

[24]  Andrzej Czygrinow,et al.  Fast Distributed Approximations in Planar Graphs , 2008, DISC.

[25]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

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

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

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