On Testing Expansion in Bounded-Degree Graphs

@inproceedings{Goldreich2000OnTE,
  title={On Testing Expansion in Bounded-Degree Graphs},
  author={Oded Goldreich and Dana Ron},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={2000}
}
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aimed towards achieving the foregoing task. The algorithm is given a (normalized) eigenvalue bound λ < 1, oracle access to a bounded-degree N-vertex graph, and two additional parameters ǫ, α > 0. The algorithm… CONTINUE READING
Highly Influential
This paper has highly influenced 23 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 235 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
149 Citations
4 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 149 extracted citations

236 Citations

02040'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 236 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…