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 e, when queried on a vertex v∈V, returns the part (subset of vertices) which 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 e|V|. In this work we give a partition oracle for graphs with excluded minors whose query complexity is quasi-polynomial in 1/e, thus improving on the result of Hassidim et al. (Proceedings of FOCS 2009) who gave a partition oracle with query complexity exponential in 1/e. 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]  G. Elek.  Parameter testing in bounded degree graphs of subexponential growth , 2010 .

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

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

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

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

[6]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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