Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus

@inproceedings{Kelner2004SpectralPE,
  title={Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus},
  author={Jonathan A. Kelner},
  booktitle={STOC},
  year={2004}
}
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: 1. It is a classical result of Gilbert, Hutchinson, and Tarjan [12] that one can find asymptotically optimal separators on these graphs if he is given both the graph and an embedding of it onto a low genus surface. Does there exist a simple, efficient algorithm to find these separators given only the graph and not the embedding? 2. In practice, spectral partitioning… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…