Random walks and forbidden minors II: A poly(dε^-1)-query tester for minor-closed properties of bounded-degree graphs

04/01/2019
by   Akash Kumar, et al.
0

Let G be a graph with n vertices and maximum degree d. Fix some minor-closed property P (such as planarity). We say that G is ε-far from P if one has to remove ε dn edges to make it have P. The problem of property testing P was introduced in the seminal work of Benjamini-Schramm-Shapira (STOC 2008) that gave a tester with query complexity triply exponential in ε^-1. Levi-Ron (TALG 2015) have given the best tester to date, with a quasipolynomial (in ε^-1) query complexity. It is an open problem to get property testers whose query complexity is poly(dε^-1), even for planarity. In this paper, we resolve this open question. For any minor-closed property, we give a tester with query complexity d·poly(ε^-1). The previous line of work on (independent of n, two-sided) testers is primarily combinatorial. Our work, on the other hand, employs techniques from spectral graph theory. This paper is a continuation of recent work of the authors (FOCS 2018) analyzing random walk algorithms that find forbidden minors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2021

k-apices of minor-closed graph classes. I. Bounding the obstructions

Let G be a minor-closed graph class. We say that a graph G is a k-apex o...
research
02/23/2021

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

In this paper we provide sub-linear algorithms for several fundamental p...
research
12/30/2018

Spectral methods for testing cluster structure of graphs

In the framework of graph property testing, we study the problem of dete...
research
05/21/2018

Finding forbidden minors in sublinear time: a n^1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs

Let G be an undirected, bounded degree graph with n vertices. Fix a fini...
research
04/27/2020

An FPT-algorithm for recognizing k-apices of minor-closed graph classes

Let G be a graph class. We say that a graph G is a k-apex of G if G cont...
research
01/06/2020

On Efficient Distance Approximation for Graph Properties

A distance-approximation algorithm for a graph property P in the adjacen...
research
10/03/2022

Local Computation of Maximal Independent Set

We present a randomized Local Computation Algorithm (LCA) with query com...

Please sign up or login with your details

Forgot password? Click here to reset