Isoperimetric partitioning: A new Algorithm for graph partitioning

SIAM Journal on Scientific Computing

Volumn 27, Issue 6, 2006, Pages 1844-1866

  Grady, Leo ^a   Schwartz, Eric L ^b  

^a SIEMENS CORPORATE RESEARCH   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

Graph partitioning; Graph theory; Isoperimetric problem; Linear equations; Spectral partitioning

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; LINEAR EQUATIONS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

GRAPH PARTITIONING; ISOPERIMETRIC PROBLEMS; SPECTRAL PARTITIONING;

GRAPH THEORY;

EID: 33751234979     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/040609008     Document Type: Article

References (68)

1. L. AHLFORS, Complex Analysis, McGraw-Hill, New York, 1966.
2. N. ALON, Eigenvalues and expanders, Combinatorica, 6 (1986), pp. 83-96.
3. 1, isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory Ser. B, 38 (1985), pp. 73-88.
4. C. J. ALPERT AND A. B. KAHNG, Recent directions in netlist partitioning: A survey, Integration: The VLSI J., 19 (1995), pp. 1-81.
5. W. N. ANDERSON, JR. AND T. D. MORLEY, Eigenvalues of the Laplacian of a graph, Linear Multilinear Algebra, 18 (1985), pp. 141-145.
6. G. ARFKEN AND H.-J. WEBER, EDS., Mathematical Methods for Physicists, 3rd ed., Academic Press, New York, 1985.
7. D. A. V. BAAK, Variational alternatives of Kirchhoff's loop theorem in DC circuits, Amer. J. Phys., 67 (1998), pp. 36-44.
8. N. BIGGS, Algebraic Graph Theory, Cambridge Tracts in Math. 67, Cambridge University Press, Cambridge, UK, 1974.
9. J. BOLZ, I. FARMER, E. GRINSPUN, AND P. SCHRÖDER, Sparse matrix solvers on the GPU: Conjugate gradients and multigrid, ACM Trans. Graphics, 22 (2003), pp. 917-924.
10. F. H. BRANIN, JR., The inverse of the incidence matrix of a tree and the formulation of the algebraic-first-order differential equations of an RLC network, IEEE Trans. Circuit Theory, 10 (1963), pp. 543-544.
11. F. H. BRANIN, JR., The algebraic-topological basis for network analogies and the vector calculus, in Proceedings of the Symposium on Generalized Networks, J. Fox, ed., Polytechnic Press, Brooklyn, NY, 1966, pp. 453-491.
12. T. N. BUI AND C. JONES, A heuristic for reducing fill-in in sparse matrix factorization, in Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, Vol. 1, R. F. Sincovec, D. Keyes, M. Leuze, L. Petzold, and D. Reed, eds., SIAM, Philadelphia, 1993, pp. 445-452.
13. F. CAO, J. R. GILBERT, AND S.-H. TENG, Partitioning Meshes with Lines and Planes, Technical report CSL-96-01, Palo Alto Research Center, Xerox Corporation, 1996.
14. T. F, CHAN, J. R. GILBERT, AND S.-H. TENG, Geometric Spectral Partitioning, Technical report CSL-94-15, Palo Alto Research Center, Xerox Corporation, 1994.
15. J. CHEEGER, A lower bound for the smallest eigenvalue of the Laplacian, in Problems in Analysis, R. Gunning, ed., Princeton University Press, Princeton, NJ, 1970, pp. 195-199.
16. F. R. K. CHUNG, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, AMS, Providence, RI, 1997.
17. J. DODZIUK, Difference equations, isoperimetric inequality and the transience of certain random walks, Trans. Am. Math. Soc., 284 (1984), pp. 787-794.
18. J. DODZIUK AND W. S. KENDALL, Combinatorial Laplacians and the isoperimetric inequality, in From Local Times to Global Geometry, Control and Physics, Pitman Res. Notes Math. Ser. 150, K. D. Ellworthy, ed., Longman Scientific and Technical, London, 1986, pp. 68-74.
19. W. DONATH AND A. HOFFMAN, Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices, IBM Tech. Disclosure Bull., 15 (1972), pp. 938-944.
20. J. J. DONGARRA, I. S. DUFF, D. C. SORENSON, AND H. A. VAN DER VORST, Solving Linear Systems on Vector and Shared Memory Computers, SIAM, Philadelphia, 1991.
21. P. DOYLE AND L. SNELL, Random Walks and Electric Networks, Carus Math. Monogr. 22, Mathematical Association of America, Washington, D.C., 1984.
22. C, M. FIDUCCIA AND R. M. MATTHEYES, A linear-time heuristic for improving network partitions, in Proceedings of the 19th ACM/IEEE Design Automation Conference, Las Vegas, 1982, IEEE Press, Piscataway, NJ, pp. 175-181.
23. M. FIEDLER, Algebraic connectivity of graphs, Czechoslovak. Math. J., 23 (1973), pp. 298-305.
24. M. FIEDLER, Eigenvectors of acyclic matrices, Czechoslovak. Math. J., 25 (1975), pp. 607-618.
25. M. FIEDLER, A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory, Czechoslovak. Math. J., 25 (1975), pp. 619-633.
26. M. FIEDLER, Special Matrices and their Applications in Numerical Mathematics, Martinus Nijhoff Publishers, Dordrecht, The Netherlands, 1986.
27. L. FOULDS, Graph Theory Applications, Universitext, Springer-Verlag, New York, 1992.
28. J. GILBERT, C. MOLER, AND R. SCHREIBER, Sparse matrices in MATLAB: Design and implementation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 333-356.
29. J. R. GILBERT, G. L. MILLER, AND S.-H. TENG, Geometric mesh partitioning: Implementation and experiments, SIAM J. Sci. Comput., 19 (1998), pp. 2091-2110.
30. G. GOLUB AND C. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
31. L. GRADY, Space-Variant Computer Vision: A Graph-Theoretic Approach, Ph.D. thesis, Boston University, Boston, MA, 2004.
32. L. GRADY AND E. L. SCHWARTZ, The Graph Analysis Toolbox: Image Processing on Arbitrary Graphs, Technical report TR-03-021, Boston University, Boston, MA, 2003.
33. K. GREMBAN, Combinatorial Preconditioners for Sparse, Symmetric Diagonally Dominant Linear Systems, Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, 1996.
34. S. GUATTERY AND G. MILLER, On the quality of spectral separators, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 701-719.
35. K. M. HALL, An r-dimensional quadratic placement algorithm, Manag. Sci., 17 (1970), pp. 219-229.
36. B. HENDRICKSON AND R. LELAND, The Chaco User's Guide, Technical report SAND95-2344, Sandia National Laboratory, Albuquerque, NM, 1995.
37. B. HENDRICKSON AND R. LELAND, A multilevel algorithm for partitioning graphs, in Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, San Diego, CA, S. Karin, ed., ACM Press, New York, 1995.
38. B. HENDRICKSON, R. LELAND, AND R. VAN DRIESSCHE, Skewed graph partitioning, in Proceedings of the Eighth SIAM Conference on Parallel Processing, M. Heath, V. Torczon, G. Astfalk, P. E. Bjorstad, A. H. Karp, C. H. Koebel, V. Kumar, R. F. Lucas, L. T. Watson, and D. E. Womble, eds., SIAM, Philadelphia, 1997.
39. Y. HU AND R. BLAKE, Numerical experiences with partitioning of unstructured meshes, Parallel Comput., 20 (1994), pp. 815-829.
40. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-393.
41. B. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J., 49 (1970), pp. 291-308.
42. J. M. KLEINHAUS, G. SIGL, F. M. JOHANNES, AND K. J. ANTREICH, GORDIAN: VLSI placement by quadratic programming and slicing optimization, IEEE Trans. Comput. Aided Design, 10 (1991), pp. 356-365.
43. D. E. KNUTH, Big omicron and big omega and big theta, SIGACT News, 8 (1976), pp. 18-24.
44. U. R. KODRES, Geometrical positioning of circuit elements in a computer, in Proceedings of the 1959 AIEE Fall General Meeting, CP59-1172, Chicago, IL, AIEE Press, New York, 1959.
45. U. R. KODRES, Partitioning and card selection, in Design Automation of Digital Systems, Vol. 1, M. A. Breuer, ed., Prentice-Hall, Englewood Cliffs, NJ, 1972, Chap. 4, pp. 173-212.
46. M. KUNZ, A Möbius inversion of the Ulam subgraphs conjecture, J. Math. Chem., 9 (1992), pp. 297-305.
47. R. B. LEHOUCQ, D. C. SORENSON, AND C. YANG, ARPACK User's Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, 1998.
48. T. LEIGHTON AND S. RAO, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46 (1999), pp. 787-832.
49. J. D. LOGAN, An introduction to nonlinear partial differential equations, Pure Appl. Math. (N. Y.), John Wiley, New York, 1994.
50. J. C. MAXWELL, A Treatise on Electricity and Magnetism, 3rd ed.,Vol. 1, Dover, New York, 1991.
51. R. MERRIS, Laplacian matrices of graphs: A survey, Linear Algebra Appl., 197-198 (1994), pp. 143-176.
52. G. L. MILLER, S.-H. TENG, W. P. THURSTON, AND S. A. VAVASIS, Automatic mesh partitioning, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, eds., IMA Vol. Math. Appl. 56, Springer-Verlag, Berlin, 1993, pp. 57-84.
53. G. L. MILLER, S.-H. TENG, W. P. THURSTON, AND S. A. VAVASIS, Geometric separators for finite-element meshes, SIAM J. Sci. Comput., 19 (1998), pp. 364-386.
54. B. MOHAR, Isoperimetric inequalities, growth and the spectrum of graphs, Linear Algebra Appl., 103 (1988), pp. 119-131.
55. B. MOHAR, Isoperimetric numbers of graphs, 3. Combin. Theory Ser. B, 47 (1989), pp. 274-291.
56. G. PÓLY A AND G. SZEGÖ, Isoperimetric Inequalities in Mathematical Physics, Ann. of Math. Stud. 56, Princeton University Press, Princeton, NJ, 1951.
57. A. POTHEN, H. SIMON, AND K.-P. LIOU, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
58. A. POTHEN, H. SIMON, AND L. WANG, Spectral Nested Dissection, Technical report CS-92-01, Pennsylvania State University, 1992.
59. B. M. RIESS, K. DOLL, AND F. M. JOHANNES, Partitioning very large circuits using analytical placement techniques, in Proceedings of the 31st ACM/IEEE Design Automation Conference, IEEE Press, Piscataway, NJ, 1994, pp. 646-651.
60. G. R. SCHREIBER AND O. C. MARTIN, Cut size statistics of graph bisection heuristics, SIAM J. Optim., 10 (1999), pp. 231-251.
61. J. SHI AND J. MALIK, Normalized cuts and image segmentation, IEEE Trans. Pattern Anal. Mach. Intelligence, 22 (2000), pp. 888-905.
62. G. SIGL, K. DOLL, AND F. M. JOHANNES, Analytical placement: A linear of a quadratic objective function?, in Proceedings of the 28th ACM/IEEE Design Automation Conference, IEEE Press, Piscataway, NJ, 1991, pp. 427-432.
63. H. D. SIMON, Partitioning of unstructured problems for parallel processing, Comput. Syst. Engrg., 2 (1991), pp. 135-148.
64. D. A. SPIELMAN AND S.-H. TENG, Spectral Partitioning Works: Planar Graphs and Finite Element Meshes, Technical report UCB CSD-96-898, University of California, Berkeley, 1996.
65. G. STRANG, Introduction to Applied Mathematics, Wellesley-Cambridge Press, Wellesley, MA, 1986.
66. S.-H. TENG, Coarsening, Sampling and Smoothing: Elements of the Multilevel Method, manuscript, 1997.
67. P. TETALI, Random walks and the effective resistance of networks, J. Theor. Probab., 4 (1991), pp. 101-109.
68. Z. WU AND R. LEAHY, An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation, IEEE Pattern Anal. Mach. Intelligence, 11 (1993), pp. 1101-1113.