• DOI:10.1002/rsa.20462
Corpus ID: 1697154

Finding Cycles and Trees in Sublinear Time

@article{Czumaj2014FindingCA,
  title={Finding Cycles and Trees in Sublinear Time},
  author={A. Czumaj and Oded Goldreich and D. Ron and Seshadhri Comandur and A. Shapira and C. Sohler},
  journal={Random Struct. Algorithms},
  year={2014},
  volume={45},
  pages={139-184}
}

A. Czumaj, Oded Goldreich, +3 authors C. Sohler

Published 2014

Mathematics, Computer Science

Random Struct. Algorithms

We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k ≥ 3 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 Ω (1) -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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed