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
    42 Citations
    On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error
    • 7
    • Highly Influenced
    • PDF
    A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error
    • 3
    • PDF
    Testing Graph Clusterability: Algorithms and Lower Bounds
    • 10
    • PDF
    Finding k-Paths in Cycle Free Graphs
    • 1
    • Highly Influenced
    • PDF
    Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
    • 12
    • PDF
    Testing Cluster Structure of Graphs
    • 20
    • PDF
    Testing bounded arboricity
    • 12
    • PDF
    A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
    • 17
    A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
    • 35
    • PDF
    Testing Bounded Arboricity

    References

    SHOWING 1-10 OF 44 REFERENCES
    A Sublinear Bipartiteness Tester for Bounded Degree Graphs
    • 85
    • PDF
    Finding k-Paths in Cycle Free Graphs
    • 1
    • PDF
    Property Testing in Bounded Degree Graphs
    • 240
    • PDF
    Every minor-closed property of sparse graphs is testable
    • 114
    • PDF
    The disjoint paths problem in quadratic time
    • 144
    • PDF
    Local Graph Partitions for Approximation and Testing
    • 121
    • PDF
    Testing the diameter of graphs
    • 34
    Tight Bounds for Testing Bipartiteness in General Graphs
    • 49
    • PDF
    Three Theorems regarding Testing Graph Properties
    • 185
    • PDF