A computational study of graph partitioning

LetG = (N, E) be an edge-weighted undirected graph. The graph partitioning problem is the problem of partitioning the node setN intok disjoint subsets of specified sizes so as to minimize the total weight of the edges connecting nodes in distinct subsets of the partition. We present a numerical study on the use of eigenvalue-based techniques to find upper and lower bounds for this problem. Results for bisecting graphs with up to several thousand nodes are given, and for small graphs some trisection results are presented. We show that the techniques are very robust and consistently produce upper and lower bounds having a relative gap of typically a few percentage points.

[1]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[2]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[3]  P. Wolfe,et al.  The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices , 1975 .

[4]  H. Wolkowicz,et al.  More Bounds for Elgenvalues Using Traces , 1980 .

[5]  E. Barnes.  An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[6]  Earl R. Barnes.  An algorithm for partitioning the nodes of a graph , 1981, CDC 1981.

[7]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[8]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[9]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[10]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[11]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[12]  J. Zowe,et al.  A combination of the bundle approach and the trust region concept , 1988 .

[13]  Anthony Vannelli,et al.  A New Heuristic for Partitioning the Nodes of a Graph , 1988, SIAM J. Discret. Math..

[14]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[15]  V. Rich.  Personal communication , 1989, Nature.

[16]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[17]  Antonio Sassano,et al.  The equipartition polytope. II: Valid inequalities and facets , 1990, Math. Program..

[18]  Antonio Sassano,et al.  The equipartition polytope. I: Formulations, dimension and basic facets , 1990, Math. Program..

[19]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[20]  Brian L. Mark,et al.  An efficient eigenvector approach for finding netlist partitions , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[22]  Bojan Mohar,et al.  Optimal linear labelings and eigenvalues of graphs , 1992, Discret. Appl. Math..

[23]  Byung Ro Moon,et al.  Hyperplane Synthesis for Genetic Algorithms , 1993, ICGA.

[24]  Curt Jones,et al.  A Heuristic for Reducing Fill-In in Sparse Matrix Factorization , 1993, PPSC.

[25]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[26]  Franz Rendl,et al.  A projection technique for partitioning the nodes of a graph , 1995, Ann. Oper. Res..