Eigenvalues, Flows and Separators of Graphs


In [1], we claimed that eigenfunctions for a graph can be used to construct graph separators to within a constant factor of the optimum. It turns out that additional assumptions on the graph are needed to guarantee this. In particular, it is enough if the gaps between consecutive eigenvtdues are bounded away from zero. The key fact is the following: A… (More)
DOI: 10.1145/258533.258675


Cite this paper

@inproceedings{Graham1997EigenvaluesFA, title={Eigenvalues, Flows and Separators of Graphs}, author={Fan Chung Graham and Shing-Tung Yau}, booktitle={STOC}, year={1997} }