Graph partitioning - a survey

[1]  C. Walshaw.  A Parallelisable Algorithm for Optimising UnstructuredMesh Partitions , 2007 .

[2]  B. Hendrickson.  The Chaco User � s Guide Version , 2005 .

[3]  R. Diekman,et al.  Load balancing strategies for distributed memory machines , 2000 .

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

[5]  S. Vavasis,et al.  Geometric Separators for Finite-Element Meshes , 1998, SIAM J. Sci. Comput..

[6]  Bruce Hendrickson,et al.  Sparse Matrix Ordering Methods for Interior Point Linear Programming , 1998, INFORMS J. Comput..

[7]  Shang-Hua Teng,et al.  How Good is Recursive Bisection? , 1997, SIAM J. Sci. Comput..

[8]  S. Shekhar,et al.  Multilevel Hypergraph Partitioning: Application In Vlsi Domain , 1997, Proceedings of the 34th Design Automation Conference.

[9]  Tony F. Chan,et al.  On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method , 1997, SIAM J. Sci. Comput..

[10]  Alex Pothen,et al.  Graph Partitioning Algorithms with Applications to Scientific Computing , 1997 .

[11]  Anshul Gupta,et al.  Fast and effective algorithms for graph partitioning and sparse-matrix ordering , 1997, IBM J. Res. Dev..

[12]  F. Pellegrini,et al.  Scotch 3.1 User's Guide , 1997 .

[13]  Vipin Kumar,et al.  Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[14]  Prabhakar Raghavan,et al.  Sparse matrix reordering schemes for browsing hypertext , 1996 .

[15]  Ralf Diekmann,et al.  The PARTY Partitioning Library User Guide - Version 1.1 , 1996 .

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

[17]  S.T. Barnard,et al.  PMRSB: Parallel Multilevel Recursive Spectral Bisection , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[18]  Martin G. Everett,et al.  A Localized Algorithm for Optimizing Unstructured Mesh Partitions , 1995, Int. J. High Perform. Comput. Appl..

[19]  Chung-Kuan Cheng,et al.  A gradient method on the initial partition of Fiduccia-Mattheyses algorithm , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[20]  Raf Van Driessche,et al.  Algorithms for static and dynamic load balancing on parallel computers , 1995 .

[21]  Martin G. Everett,et al.  Partitioning & Mapping of Unstructured Meshes to Parallel Machine Topologies , 1995, IRREGULAR.

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

[23]  Gary L. Miller,et al.  Geometric mesh partitioning: implementation and experiments , 1995, Proceedings of 9th International Parallel Processing Symposium.

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

[25]  Denis Vanderstraeten,et al.  Optimized partitioning of unstructured finite element meshes , 1995 .

[26]  Martin Berzins,et al.  Dynamic load-balancing for PDE solvers on adaptive unstructured meshes , 1995, Concurr. Pract. Exp..

[27]  Chris Walshaw,et al.  Dynamic mesh partitioning: a unified optimisation and load-balancing algorithm , 1995 .

[28]  Martin G. Everett,et al.  JOSTLE: Partitioning of Unstructured Meshes for Massively Parallel Machines , 1995 .

[29]  M. Shephard,et al.  Load balancing for the parallel adaptive solution of partial differential equations , 1994 .

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

[31]  Bruce Hendrickson,et al.  An empirical study of static load balancing algorithms , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[32]  Geoffrey C. Fox,et al.  Parallel Computing Works , 1994 .

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

[34]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[35]  Tony F. Chan,et al.  A SIGN CUT VERSION OF THE RECURSIVE SPECTRAL BISECTION GRAPH PARTITIONING ALGORITHM , 1994 .

[36]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[37]  R. Diekmann,et al.  Using helpful sets to improve graph bisections , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[38]  T. Chan,et al.  Geometric Spectral Partitioning , 1994 .

[39]  H. D. Simon,et al.  A spectral algorithm for envelope reduction of sparse matrices , 1993, Supercomputing '93. Proceedings.

[40]  Mark Jerrum,et al.  Simulated annealing for graph bisection , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

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

[42]  Steven Warren Hammond,et al.  Mapping unstructured grid computations to massively parallel computers , 1992 .

[43]  Gary Chartrand,et al.  Applied and algorithmic graph theory , 1992 .

[44]  H. Simon,et al.  Spectral Nested Dissection 1 , 1992 .

[45]  R. Freund,et al.  QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .

[46]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..

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

[48]  Charbel Farhat,et al.  A simple and efficient automatic fem domain decomposer , 1988 .

[49]  R. M. Mattheyses,et al.  A linear-time heuristic for improving network partitions , 1988 .

[50]  William L. Briggs,et al.  A multigrid tutorial , 1987 .

[51]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[52]  G. Golub.  Matrix computations , 1983 .

[53]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[54]  Philippe G. Ciarlet,et al.  Handbook of Numerical Analysis , 1976 .

[55]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[56]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

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

[58]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[59]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).