Testing Hamiltonicity (and other problems) in Minor-Free Graphs

In this paper we provide sub-linear algorithms for several fundamental problems in the setting in which the input graph excludes a fixed minor, i.e., is a minor-free graph. In particular, we provide the following algorithms for minor-free unbounded degree graphs. 1. A tester for Hamiltonicity with two-sided error with poly(1/ǫ)-query complexity, where ǫ is the proximity parameter. 2. A local algorithm, as defined by Rubinfeld et al. (ICS 2011), for constructing a spanning subgraph with almost minimum weight, specifically, at most a factor (1+ǫ) of the optimum, with poly(1/ǫ)-query complexity. Both our algorithms use partition-oracles, a tool introduced by Hassidim et al. (FOCS 2009), which are oracles that provide access to a partition of the graph such that the number of cutedges is small and each part of the partition is small. The polynomial dependence in 1/ǫ of our algorithms is achieved by combining the recent poly(d/ǫ)-query partition oracle of KumarSeshadhri-Stolman (ECCC 2021) for minor-free graphs with degree bounded by d. For bounded degree minor-free graphs we introduce the notion of covering partition oracles which is a relaxed version of partition oracles and design a poly(d/ǫ)-time covering partition oracle for this family of graphs. Using our covering partition oracle we provide the same results as above (except that the tester for Hamiltonicity has one sided error) for minor free bounded degree graphs, as well as showing that any property which is monotone and additive (e.g. bipartiteness) can be tested in minor-free graphs by making poly(d/ǫ)-queries. The benefit of using the covering partition oracle rather than the partition oracle in our algorithms is its simplicity and an improved polynomial dependence in 1/ǫ in the obtained query complexity. Efi Arazi School of Computer Science, The Interdisciplinary Center, Israel. Email: reut.levi1@idc.ac.il. Efi Arazi School of Computer Science, The Interdisciplinary Center, Israel. Email: nadav.shoshan1@post.idc.ac.il.

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

[2]  Artur Czumaj,et al.  A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs) , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[3]  Isolde Adler,et al.  An explicit construction of graphs of bounded degree that are far from being Hamiltonian , 2020 .

[4]  Hiro Ito.  Every property is testable on a natural class of scale-free multigraphs , 2016, ESA.

[5]  Ronitt Rubinfeld,et al.  Constructing near spanning trees with few local inspections , 2015, Random Struct. Algorithms.

[6]  Ilan Newman,et al.  Every Property of Outerplanar Graphs is Testable , 2016, APPROX-RANDOM.

[7]  Oded Goldreich.  On Testing Hamiltonicity in the Bounded Degree Graph Model , 2020, Electron. Colloquium Comput. Complex..

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

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

[10]  Robert E. Tarjan,et al.  Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[11]  Yuichi Yoshida,et al.  Testing Forest-Isomorphism in the Adjacency List Model , 2014, ICALP.

[12]  Moti Medina,et al.  A (Centralized) Local Guide , 2017, Bull. EATCS.

[13]  Noga Alon,et al.  Space-efficient local computation algorithms , 2011, SODA.

[14]  Ronitt Rubinfeld,et al.  Fast Local Computation Algorithms , 2011, ICS.

[15]  Yuichi Yoshida,et al.  Query-Number Preserving Reductions and Linear Lower Bounds for Testing , 2010, IEICE Trans. Inf. Syst..

[16]  Ronitt Rubinfeld,et al.  Local Computation Algorithms for Spanners , 2019, ITCS.

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

[18]  Christoph Lenzen,et al.  A Centralized Local Algorithm for the Sparse Spanning Graph Problem , 2018, ICALP.

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

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

[21]  Marek Karpinski,et al.  Approximation Hardness of TSP with Bounded Metrics , 2001, ICALP.

[22]  Ronitt Rubinfeld,et al.  Local Algorithms for Sparse Spanning Graphs , 2014, APPROX-RANDOM.

[23]  Krzysztof Onak,et al.  Planar Graphs: Random Walks and Bipartiteness Testing , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[24]  Akash Kumar,et al.  Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes , 2021, Electron. Colloquium Comput. Complex..

[25]  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).

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