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

SIAM Journal on Computing

Volumn 35, Issue 4, 2006, Pages 882-902

  Kelner, Jonathan A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bounded genus; Circle packing; Graph separators; Laplacian; Partitioning; Spectral partitioning

Indexed keywords

BOUNDED GENUS; CIRCLE PACKING; GRAPH SEPARATORS; PARTITIONING; SPECTRAL PARTITIONING;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS;

GRAPH THEORY;

EID: 33747185440     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447244     Document Type: Conference Paper

References (29)

1. E. M. ANDREEV, Convex polyhedra in Lobacevskii space, Math. USSR Sbornik, 10 (1970), pp. 413-440.
2. N. ALON, P. SEYMOUR, AND R. THOMAS, A separator theorem for nonplanar graphs, J. Amer. Math. Soc., 3 (1990), pp. 801-808.
3. C. J. ALPERT AND A. B. KAHNG, Recent directions in netlist partitioning: A survey, Integration: The VLSI Journal, 19 (1995), pp. 1-81.
4. A. F. BEARDON AND K. STEPHENSON, The uniformization theorem for circle packings, Indiana Univ. Math. J., 39 (1990), pp. 1383-1425.
5. P. BOWERS AND K. STEPHENSON, Uniformizing dessins and Belyǐ maps via circle packing, Mem. Amer. Math. Soc., 170 (2004).
6. P. CHAN, M. SCHLAG, AND J. ZIEN, Spectral k-way ratio-cut partitioning and clustering, IEEE Trans. Computer-Aided Design Integrated Circuits Systems, 13 (1994), pp. 1088-1096.
7. T. CHAN AND D. C. RESASCO, A framework for the analysis and construction of domain decomposition preconditioners, in Proceedings of the First International Symposium on Domain Decomposition Methods, Paris, 1987, R. Glowinski et al., eds., SIAM, Philadelphia, 1988, pp. 217-230.
8. T. CHAN AND B. SMITH, Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes, Contemp. Math., (1993), pp. 1-14.
9. F. R. K. CHUNG, Spectral Graph Theory, AMS, Providence, RI, 1997.
10. H. DJIDJEV, A linear algorithm for partitioning graphs, C. R. Acad. Bulgare Sci., 35 (1982), pp. 1053-1056.
11. H. DJIDJEV AND J. REIF, An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs, in Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, New Orleans, LA, 1991, ACM, New York, pp. 337-348.
12. O(g)) steps, in Proceedings of the 11th Annual ACM Symposium on the Theory of Computing, Atlanta, GA, 1979, ACM, New York, pp. 27-37.
13. O. FORSTER, Lectures on Riemann Surfaces, Springer-Verlag, New York, 1981.
14. J. GILBERT, J. HUTCHINSON, AND R. TARJAN, A separation theorem for graphs of bounded genus, J. Algorithms, 5 (1984), pp. 391-407.
15. S. GUATTERY AND G. L. MILLER, On the performance of spectral graph partitioning methods, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1995, SIAM, Philadelphia, 1995, pp. 233-242.
16. L. HAGEN AND A. B. KAHNG, New spectral methods for ratio cut partitioning and clustering, IEEE Trans. Computer-Aided Design, 11 (1992), pp. 1074-1085.
17. Z.-X. HE AND O. SCHRAMM. Fixed points, Koebe. uniformization, and circle packings, Ann. Math., 137 (1993), pp. 369-406.
18. P. KOEBE, Kontaktprobleme der Konformen Abbildung, Ber. Sächs. Akad. Wiss. Leipzig, Math.-Phys. Kl., 88 (1936), pp. 141-164.
19. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
20. G. MCCAUGHAN, A recurrence/transience result for circle packings, Proc. Amer. Math. Soc., 126 (1998), pp. 3647-3656.
21. B. MOHAR, A linear time algorithm for embedding graphs in an arbitrary surface, SIAM J. Discrete Math., 12 (1999), pp. 6-26.
22. G. MIHAIL, Conductance and convergence of Markov chains - A combinatorial treatment of expanders, in Proceedings of the 29th Annual IEEE Conference on Foundations of Computer Science, 1989, IEEE Press, Piscataway, NJ, pp. 526-531.
23. B. RODIN AND D. SULLIVAN, The convergence of circle packings to the Riemann mapping, J. Differential Geometry, 26 (1987), pp. 349-360.
24. H. SIMON, Partitioning of unstructured problems for parallel processing, Comput. Systems Engineering, 2 (1991), pp. 135-148.
25. D. A. SPIELMAN AND S.-H. TENG, Spectral partitioning works: Planar graphs and finite element meshes, in Proceedings of the 37th Annual IEEE Conference on Foundations of Computer Science, Burlington, VT, 1996, IEEE Press, Piscataway, NJ, 1996, pp. 96-105.
26. K. STEPHENSON, Circle packing and discrete analytic function theory, in Handbook of Complex Analysis, Vol. 1: Geometric Function Theory, R. Kühnau, ed., Elsevier, New York, Chapter 11.
27. C. THOMASSEN, The graph genus problem is NP-complete, J. Algorithms, 10 (1989), pp. 568-576.
28. W. THURSTON, The Geometry and Topology of 3-Manifolds, Princeton University Notes, preprint.
29. R. D. WILLIAMS, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency: Pract. Exp., 3 (1991), pp. 457-481.