Multiset graph partitioning

Abstract. Local optimality conditions are given for a quadratic programming formulation of the multiset graph partitioning problem. These conditions are related to the structure of the graph and properties of the weights.

[1]  William W. Hager,et al.  Graph Partitioning and Continuous Quadratic Programming , 1999, SIAM J. Discret. Math..

[2]  Gary L. Miller,et al.  Geometric Mesh Partitioning: Implementation and Experiments , 1998, SIAM J. Sci. Comput..

[3]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[4]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[5]  Brian Kernighan,et al.  An efficient heuristic for partitioning graphs , 1970 .

[6]  Qing Zhao,et al.  Semidefinite Programming Relaxations for the Graph Partitioning Problem , 1999, Discret. Appl. Math..

[7]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[8]  Shang-Hua Teng,et al.  Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation , 1998, SIAM J. Sci. Comput..

[9]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning , 1995 .

[10]  C. B. Luis.  Une caractérisation complète des minima locaux en programmation quadratique , 1980 .

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

[12]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[13]  I. Bomze.  BLOCK PIVOTING AND SHORTCUT STRATEGIES FOR DETECTING COPOSITIVITY , 1996 .

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

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

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

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

[18]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[19]  Panos M. Pardalos,et al.  Continuous Characterizations of the Maximum Clique Problem , 1997, Math. Oper. Res..

[20]  Chung-Kuan Cheng,et al.  An improved two-way partitioning algorithm with stable performance [VLSI] , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  J. Borwein.  Necessary and sufficient conditions for quadratic minimality , 1982 .

[22]  Bruce Hendrickson,et al.  Improving the Run Time and Quality of Nested Dissection Ordering , 1998, SIAM J. Sci. Comput..

[23]  Michael T. Heath,et al.  A Cartesian Parallel Nested Dissection Algorithm , 1992, SIAM J. Matrix Anal. Appl..

[24]  Franz Rendl,et al.  A computational study of graph partitioning , 1994, Math. Program..

[25]  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.

[26]  Gary L. Miller,et al.  Automatic Mesh Partitioning , 1992 .

[27]  A. Hoffman,et al.  Partitioning, Spectra and Linear Programming , 1984 .

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