Spectral partitioning works: Planar graphs and finite element meshes

Linear Algebra and Its Applications

Volumn 421, Issue 2-3 SPEC. ISS., 2007, Pages 284-305

  Spielman, Daniel A ^a   Teng, Shang Hua ^b  

^a Yale University   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

Eigenvalue problems; Graph embedding; Graph partitioning; Spectral analysis; Spectral methods

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; FINITE ELEMENT METHOD; GRAPH THEORY;

EIGENVALUE PROBLEMS; GRAPH EMBEDDING; GRAPH PARTITIONING; LAPLACIAN MATRICES; SPECTRAL METHODS;

SPECTRUM ANALYSIS;

EID: 33846251992     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.07.020     Document Type: Article

References (83)

1. Agarwal P., and Pach J. Combinatorial Geometry (1995), Wiley-Interscience
2. Alpert C.J., and Kahng A.B. Recent directions in netlist partitioning: a survey. Integration: The VLSI J. 19 (1995) 1-81
3. Alon N. Eigenvalues and expanders. Combinatorica 6 2 (1986) 83-96
4. 1, isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Series B 38 (1985) 73-88
5. Andreev E.M. On convex polyhedra in lobacevskii space. Math. USSR Sbornik 10 3 (1970) 413-440
6. Andreev E.M. On convex polyhedra of finite volume in lobacevskii space. Math. USSR Sbornik 12 2 (1970) 259-270
7. Alon N., Seymour P., and Thomas R. A separator theorem for graphs with an excluded minor and its applications. Proceedings of the 22th Annual ACM Symposium on Theory of Computing (1990), ACM 293-299
8. S. Arora, S. Rao, U. Vazirani, Expander flows, geometric embeddings and graph partitioning, in: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, 2004, pp. 222-231.
9. Babuška I., and Aziz A.K. On the angle condition in the finite element method. SIAM J. Numer. Anal. 13 2 (1976) 214-226
10. Barnes E.R. An algorithm for partitioning of nodes of a graph. SIAM J. Algebraic Discrete Methods 4 3 (1982) 541-550
11. Berger M.J., and Bokhari S. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans. Comp. C-36 (1987) 570-580
12. Bern M., and Eppstein D. Mesh generation and optimal triangulation. In: Hwang F.K., and Du D.-Z. (Eds). Computing in Euclidean Geometry (1992), World Scientific 23-90
13. Bern M., Eppstein D., and Gilbert J.R. Provably good mesh generation. J. Comput. Syst. Sci. 48 (1994) 384-409
14. Barnes E.R., and Hoffman A.J. Partitioning, spectra and linear programming. Progr. Combin. Optim. (1984) 13-25
15. Barnes J., and Hut P. A hierarchical O(nlog n) force calculation algorithm. Nature 324 (1986) 446-449
16. Biggs N. Algebraic Graph Theory. second ed. (1993), Cambridge University Press, New York, NY
17. Boppana R. Eigenvalues and graph bisection: an average-case analysis. 28th Annual Symposium on Foundations of Computer Science, Los Angeles, October 1987 (1987), IEEE 280-285
18. S.T. Barnard, H.D. Simon, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Technical Report RNR-92-033, NASA Ames Research Center, 1992.
19. Cvetkovic D.M., Doob M., and Sachs H. Spectra of Graphs:Theory and Application (1990), Academic Press, New York
20. Cheeger J. A lower bound for the smallest eigenvalue of the laplacian. In: Gunning R.C. (Ed). Problems in Analysis (1970), Princeton University Press 195-199
21. T.F. Chan, D.C. Resasco, A framework for the analysis and construction of domain decomposition preconditioners, Technical Report CAM-87-09, UCLA, 1987.
22. Chung F.R.K. Diameters and eigenvalues. J. Amer. Math. Soc. 2 2 (1989) 187-196
23. Chung F.R.K. Spectral Graph Theory (1997), Amer. Math. Soc., Providence, RI
24. Conway J.H., and Sloane N.J.A. Sphere Packings, Lattices and Groups (1988), Springer-Verlag
25. Chan T.F., and Smith B. Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes. Contemp. Math. (1993) 1-14
26. P.K. Chan, M. Schlag, J. Zien, Spectral k-way ratio cut partitioning and clustering, in: Symp. on Integrated Systems, 1993.
27. H.N. Djidjev, J. R. Gilbert, Separators in graphs with negative and multiple vertex weights, Technical Report CS-92-07, Xerox PARC, Palo Alto, 1992.
28. Donath W.E., and Hoffman A.J. Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices. IBM Techn. Disclosure Bull. 15 (1972) 938-944
29. Donath W.E., and Hoffman A.J. Lower bounds for the partitioning of graphs. J. Res. Develop. 17 (1973) 420-425
30. Diaconis P., and Strook D. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 1 (1991) 36-61
31. Edelsbrunner H. Algorithms in Combinatorial Geometry (1987), Springer-Verlag, NY
32. Eppstein D., Miller G.L., and Teng S.-H. A deterministic linear time algorithm for geometric separators and its applications. Fund. Inform. 22 4 (1995) 309-330
33. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23 98 (1973) 298-305
34. Fiedler M. Eigenvectors of acyclic matrices. Czechoslovak Math. J. 25 100 (1975) 607-618
35. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Math. J. 25 100 (1975) 619-633
36. Fill J.A. Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1 1 (1991) 62-87
37. Fried I. Condition of finite element matrices generated from nonuniform meshes. AIAA J. 10 (1972) 219-221
38. Garg N., Saran H., and Vazirani V.V. Finding separator cuts in planar graphs within twice the optimal. SIAM J. Comput. 29 1 (1999) 159-179
39. Gilbert J.R., Hutchinson J.P., and Tarjan R.E. A separation theorem for graphs of bounded genus. J. Algorith. 5 (1984) 391-407
40. John Russell Gilbert, Graph Separator theorems and sparse gaussian elimination, Ph.D. thesis, Computer Science Department, Stanford University, 1980.
41. J.R. Gilbert, N. Kahale, personal communication, 1995.
42. Guattery S., and Miller G.L. On the performance of the spectral graph partitioning methods. Proceedings of The Second Annual ACM-SIAM Symposium on Discrete Algorithms (1995), ACM-SIAM 233-242
43. Greengard L., and Roklin V. A fast algorithm for particles simulations. J. Comput. Phys. 73 (1987) 325-348
44. Hilbert D., and Cohn-Vossen S. Geometry and the Imagination (1952), Chelsea Publishing Company, New York
45. Hackney R.W., and Eastwood J.W. Computer Simulation Using Particles (1981), McGraw-Hill
46. Hagen L., and Kahng A.B. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Computer-Aided Des. 11 9 (1992) 1074-1085
47. Hall K.M. An r-dimensional quadratic placement algorithm. Manage. Sci. 17 (1970) 219-229
48. Bruce Hendrickson, Robert Leland, An improved spectral graph partitioning algorithm for mapping parallel computation, Technical Report SAND92-1460, Sandia National Lab., December 1992.
49. Bruce Hendrickson, Robert Leland, The Chaco user's guide, Version 1.0, Technical Report SAND93-2339, Sandia National Lab., 1993.
50. Johnson C. Numerical Solution of Partial Differential Equations by the Finite Element Method (1992), Cambridge University Press
51. J.A. Kelner, Spectral partitioning, eigenvalue Bounds, and circle packings for graphs of bounded genus, in: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, 2004.
52. Koebe P. Kontaktprobleme der konformen Abbildung. Ber. Verh. Sächs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse 88 (1936) 141-164
53. F.T. Leighton, S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in: 29th Annual Symposium on Foundations of Computer Science, 1988, pp. 422-431.
54. Lipton R.J., and Tarjan R.E. A separator theorem for planar graphs. SIAM J. Appl Math. 36 April (1979) 177-189
55. Mihail M. Conductance and convergence of Markov chains-a combinatorial treatment of expanders. 30th Annual Symposium on Foundations of Computer Science (1989), IEEE 526-531
56. B. Mohar, The Laplacian spectrum of graphs, in: Sixth International Conference on the Theory and Applications of Graphs, 1988, pp. 871-898.
57. Mohar B. Isoperimetric numbers of graphs. J. Combin. Theory, Series B 47 (1989) 274-291
58. Miller G.L., and Thurston W. Separators in two and three dimensions. Proceedings of the 22th Annual ACM Symposium on Theory of Computing, Baltimore, May 1990 (1990), ACM 300-309
59. Miller G.L., Teng S.-H., Thurston W., and Vavasis S.A. Finite element meshes and geometric separators. SIAM J. Scient. Comput. 19 2 (1998)
60. Miller G.L., Teng S.-H., Thurston W., and Vavasis S.A. Separators for sphere-packings and nearest neighborhood graphs. J. ACM 44 1 (1997) 1-29
61. Miller G.L., Talmor D., Teng S.-H., and Walkington N. A Delaunay based numerical method for three dimensions: generation, formulation, and partition. Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, May 1995 (1995), ACM 683-692
62. Miller G.L., Teng S.-H., and Vavasis S.A. An unified geometric approach to graph separators. 32nd Annual Symposium on Foundations of Computer Science (1991), IEEE 538-547
63. Gary L. Miller, Stephen A. Vavasis, Density graphs and separators, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 331-336.
64. Nicolaides R.A. Direct discretization of planar div-curl problems. SIAM J. Numer. Anal. 29 1 (1992)
65. Plotkin S., Rao S., and Smith W.D. Shallow excluded minors and improved graph decomposition. 5th Symp. Discrete Algorithms (1994), SIAM 462-470
66. Pothen A., Simon H.D., and Liou K.-P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11 (1990) 430-452
67. Parlett B., Simon H., and Stringer L. Estimating the largest eigenvalues with the lanczos algorithm. Math. Comput. 38 (1982) 153-165
68. A. Pothen, H. D. Simon, L. Wang, Spectral nested dissection, Technical Report CS-92-01, Pennsylvania State University, Department of Computer Science, 1992.
69. Strang G., and Fix G.J. An Analysis of the Finite Element Method (1973), Prentice-Hall, Englewood Cliffs, New Jersey
70. Simon H.D. Partitioning of unstructured problems for parallel processing. Comput. Syst. Eng. 2 2/3 (1991) 135-148
71. Sinclair A.J., and Jerrum M.R. Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988), ACM 235-244
72. Sinclair A., and Jerrum M. Approximative counting, uniform generation and rapidly mixing Markov chains. Inform. Comput. 82 1 (1989) 93-133
73. D.A. Spielman, S.-H. Teng, Disk packings and planar separators, in: Proceedings of 12th ACM Symposium on Computational Geometry, May 1996, pp. 358-394.
74. D.A. Spielman, S.-H. Teng, Spectral partitioning works: planar graphs and finite element meshes, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 96-106.
75. Strang G. Linear Algebra and Its Applications (1988), Harcourt Brace Jovanovich, Publishers, San Diego, CA
76. S.-H. Teng, Points, spheres, and separators: a unified geometric approach to graph partitioning, Ph.D. thesis, Carnegie-Mellon University, School of Computer Science, 1991, CMU-CS-91-184.
77. Teng S.-H. Provably good partitioning and load balancing algorithms for parallel adaptive n-body simulation. SIAM J. Scient. Comput. 19 2 (1998) 635-656
78. Teng S.-H. Combinatorial aspects of geometric graphs. Comput. Geom. 9 (1998) 277-287
79. W.P. Thurston, The geometry and topology of 3-manifolds, Princeton University Notes, 1988.
80. Thompson J.F., Warsi Z.U.A., and Mastin C.W. Numerical Grid Generation: Foundations and Applications (1985), North Holland, New York
81. Ungar P. A theorem on planar graphs. J. London Math. Soc. 26 (1951) 256-262
82. R.D. Williams, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Technical Report, California Institute of Technology, 1990.
83. F. Zhao, An O(n) algorithm for three-dimensional n-body simulation, Technical Report TR AI Memo 995, MIT, AI Lab., October 1987.