A separator theorem for graphs of bounded genus
Journal of Algorithms
The graph genus problem is NP-complete
Journal of Algorithms
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Spectral k-way ratio-cut partitioning and clustering
Proceedings of the 1993 symposium on Research on integrated systems
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
On the performance of spectral graph partitioning methods
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Hi-index | 0.00 |
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 heuristics work extremely well on these graphs. Is there a theoretical reason why this should be the case.We resolve these two questions by showing that a simple spectral algorithm finds separators of cut ratio O(√g/n) and vertex bisectors of size O(√gn) in these graphs, both of which are optimal. As our main technical lemma, we prove an O(g/n) bound on the second smallest eigenvalue of the Laplacian of such graphs and show that this is tight, thereby resolving a conjecture of Spielman and Teng. While this lemma is essentially combinatorial in nature, its proof comes from continuous mathematics, drawing on the theory of circle packings and the geometry of compact Riemann surfaces.