Research partially supported by EPSRC awards EP/G064679/1and EP/D063191/1.
Finding cycles and trees in sublinear time
Version of Record online: 22 AUG 2012
© 2012 Wiley Periodicals, Inc.
Random Structures & Algorithms
Volume 45, Issue 2, pages 139–184, September 2014
How to Cite
Czumaj, A., Goldreich, O., Ron, D., Seshadhri, C., Shapira, A. and Sohler, C. (2014), Finding cycles and trees in sublinear time. Random Struct. Alg., 45: 139–184. doi: 10.1002/rsa.20462
- Issue online: 25 JUL 2014
- Version of Record online: 22 AUG 2012
- Manuscript Accepted: 12 JUN 2012
- Manuscript Revised: 29 MAR 2012
- Manuscript Received: 21 APR 2011
- sublinear-time algorithms;
- property testing;
- bounded-degree graphs;
- one-sided versus two-sided error probability
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being Ck-minor free (resp., free from having the corresponding tree-minor). In particular, if the graph is -far from being cycle-free (i.e., a constant fraction of the edges must be deleted to make the graph cycle-free), then the algorithm finds a cycle of polylogarithmic length in time , where N denotes the number of vertices. This time complexity is optimal up to polylogarithmic factors.
The foregoing results are the outcome of our study of the complexity of one-sided error property testing algorithms in the bounded-degree graphs model. For example, we show that cycle-freeness of N-vertex graphs can be tested with one-sided error within time complexity , where ∊ denotes the proximity parameter. This matches the known query lower bound for one-sided error cycle-freeness testing, and contrasts with the fact that any minor-free property admits a two-sided error tester of query complexity that only depends on ∊. We show that the same upper bound holds for testing whether the input graph has a simple cycle of length at least k, for any . On the other hand, for any fixed tree T, we show that T-minor freeness has a one-sided error tester of query complexity that only depends on the proximity parameter ∊.
Our algorithm for finding cycles in bounded-degree graphs extends to general graphs, where distances are measured with respect to the actual number of edges. Such an extension is not possible with respect to finding tree-minors in complexity. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 139–184, 2014