Testing cycle-freeness: Finding a certificate

We deal with the problem of designing one-sided error property testers for cycle-freeness in bounded degree graphs. Such a property tester always accepts forests. Furthermore, when it rejects an input, it provides a short cycle as a certificate. The problem of testing cycle-freeness in this model was first considered by Goldreich and Ron \cite{GR97}. They give a constant time tester with two-sided error (it does not provide certificates for rejection) and prove a $\Omega(\sqrt{n})$ lower bound for testers with one-sided error. We design a property tester with one-sided error whose running time matches this lower bound (upto polylogarithmic factors). Interestingly, this has connections to a recent conjecture of Benjamini, Schramm, and Shapira \cite{BSS08}. The property of cycle-freeness is closed under the operation of taking minors. This is the first example of such a property that has an almost optimal $\otilde(\sqrt{n})$-time one-sided error tester, but has a constant time two-sided error tester. It was conjectured in \cite{BSS08} that this happens for a vast class of minor-closed properties, and this result can seen as the first indication towards that.

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

[2]  Asaf Shapira,et al.  Testing the expansion of a graph , 2010, Inf. Comput..

[3]  Dana Ron,et al.  Property Testing , 2000 .

[4]  Noga Alon,et al.  A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[5]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

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

[7]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[8]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[9]  Seshadhri Comandur,et al.  Testing Expansion in Bounded Degree Graphs , 2007, Electron. Colloquium Comput. Complex..

[10]  Artur Czumaj,et al.  On testable properties in bounded degree graphs , 2007, SODA '07.

[11]  Ronitt Rubinfeld,et al.  Sublinear Time Algorithms , 2011, SIAM J. Discret. Math..

[12]  Dana Ron,et al.  On Testing Expansion in Bounded-Degree Graphs , 2000, Studies in Complexity and Cryptography.

[13]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[14]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[15]  Dana Ron,et al.  Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.

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