Recent Advances in Graph Partitioning

We survey recent trends in practical algorithms for balanced graph partitioning, point to applications and discuss future research directions.

[1]  Rinker Hall Tuesdays.  THE UNIVERSITY OF FLORIDA. , 1905, Science.

[2]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[3]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[4]  J. Davenport.  Editor , 1960 .

[5]  B. Ripley,et al.  Pattern Recognition , 1968, Nature.

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

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

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

[9]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

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

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

[12]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[13]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[14]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[15]  Frank Thomson Leighton,et al.  Graph Bisection Algorithms with Good Average Case Behavior , 1984, FOCS.

[16]  Editors , 1986, Brain Research Bulletin.

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

[18]  D. Lambert,et al.  Strategic Logistics Management , 1987 .

[19]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[20]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[21]  Kunkel Jm,et al.  Spontaneous subclavain vein thrombosis: a successful combined approach of local thrombolytic therapy followed by first rib resection. , 1989 .

[22]  Laura A. Sanchis,et al.  Multiple-Way Network Partitioning , 1989, IEEE Trans. Computers.

[23]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[25]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[26]  Ten-Hwang Lai,et al.  The Complexity of Congestion-1 Embedding in a Hypercube , 1991, J. Algorithms.

[27]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

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

[29]  Juraj Hromkovic,et al.  The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems) , 1992, Informatik.

[30]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[31]  Shantanu Dutt.  New faster Kernighan-Lin-type graph-partitioning algorithms , 1993, ICCAD.

[32]  Dorothea Wagner,et al.  Between Min Cut and Graph Bisection , 1993, MFCS.

[33]  Charbel Farhat,et al.  Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics , 1993 .

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

[35]  F. Pellegrini,et al.  Static mapping by dual recursive bipartitioning of process architecture graphs , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

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

[37]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

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

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

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

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

[42]  Fred W. Glover,et al.  Tabu search for graph partitioning , 1996, Ann. Oper. Res..

[43]  Jean Roman,et al.  SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs , 1996, HPCN Europe.

[44]  Bruce Hendrickson,et al.  Enhancing data locality by using terminal propagation , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

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

[46]  Martin G. Everett,et al.  Parallel dynamic load-balancing for adaptive unstructured meshes , 1997, Parallel CFD.

[47]  Vipin Kumar,et al.  Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes , 1997, J. Parallel Distributed Comput..

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

[49]  Martin G. Everett,et al.  Dynamic Load-Balancing for Parallel Adaptive Unstructured Meshes , 1997, PP.

[50]  Giovanni Rinaldi,et al.  A branch-and-cut algorithm for the equicut problem , 1997, Math. Program..

[51]  José D. P. Rolim,et al.  Solving Irregularly Structured Problems in Parallel , 1997, Lecture Notes in Computer Science.

[52]  Hans Werner Meuer,et al.  Top500 Supercomputer Sites , 1997 .

[53]  Joseph Naor,et al.  Fast approximate graph partitioning algorithms , 1997, SODA '97.

[54]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[55]  Mark Jerrum,et al.  The Metropolis Algorithm for Graph Bisection , 1998, Discret. Appl. Math..

[56]  Laurence A. Wolsey,et al.  The node capacitated graph partitioning problem: A computational study , 1998, Math. Program..

[57]  Bruce Hendrickson,et al.  Graph Partitioning and Parallel Solvers: Has the Emperor No Clother? (Extended Abstract) , 1998, IRREGULAR.

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

[59]  Vipin Kumar,et al.  Multilevel k-way hypergraph partitioning , 1999, DAC '99.

[60]  Robert Preis,et al.  Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[61]  Vipin Kumar,et al.  Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs , 1999, SIAM Rev..

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

[63]  Chris Walshaw,et al.  Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm , 2000, SIAM J. Sci. Comput..

[64]  Ralf Diekmann,et al.  Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM , 2000, Parallel Comput..

[65]  Robert van Engelen,et al.  Graph Partitioning for High Performance Scienti c Simulations , 2000 .

[66]  Robert Krauthgamer,et al.  A polylogarithmic approximation of the minimum bisection , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[67]  G. Karypis,et al.  Algorithm for Load-balancing Adaptive Scienti c Simulations , 2000 .

[68]  Tamara G. Kolda,et al.  Graph partitioning models for parallel computing , 2000, Parallel Comput..

[69]  Franz Rendl,et al.  Solving Graph Bisection Problems with Semidefinite Programming , 2000, INFORMS J. Comput..

[70]  Joseph E. Flaherty,et al.  A hierarchical partition model for adaptive finite element computation , 2000 .

[71]  Vipin Kumar,et al.  A Unified Algorithm for Load-balancing Adaptive Scientific Simulations , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[72]  Frank Schulz,et al.  Using Multi-Level Graphs for Timetable Information , 2001 .

[73]  Norbert Sensen,et al.  Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows , 2001, ESA.

[74]  Vipin Kumar,et al.  Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes , 2001, IEEE Trans. Parallel Distributed Syst..

[75]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[76]  Ümit V. Çatalyürek,et al.  A Hypergraph-Partitioning Approach for Coarse-Grain Decomposition , 2001, ACM/IEEE SC 2001 Conference (SC'01).

[77]  Chris Walshaw,et al.  Multilevel mesh partitioning for heterogeneous communication networks , 2001, Future Gener. Comput. Syst..

[78]  Vipin Kumar,et al.  Parallel static and dynamic multi‐constraint graph partitioning , 2002, Concurr. Comput. Pract. Exp..

[79]  Jens-Michael Wierum,et al.  On the Quality of Partitions Based on Space-Filling Curves , 2002, International Conference on Computational Science.

[80]  Chris Walshaw,et al.  Parallel mesh partitioning on distributed memory systems , 2002 .

[81]  Christos D. Zaroliagis,et al.  Using Multi-level Graphs for Timetable Information in Railway Systems , 2002, ALENEX.

[82]  Franz Rendl,et al.  Graph partitioning using linear and semidefinite programming , 2003, Math. Program..

[83]  Stefan Hougardy,et al.  A simple approximation algorithm for the weighted matching problem , 2003, Inf. Process. Lett..

[84]  Meinolf Sellmann,et al.  Multicommodity Flow Approximation Used for Exact Graph Partitioning , 2003, ESA.

[85]  Joseph R. Shinnerl,et al.  Multilevel Optimization in VLSICAD , 2003 .

[86]  Vipin Kumar,et al.  Graph partitioning for high-performance scientific simulations , 2003 .

[87]  Gerhard Zumbusch,et al.  Parallel Multilevel Methods , 2003 .

[88]  P. Sanders,et al.  A simpler linear time 2 / 3 − ε approximation for maximum weight matching , 2004 .

[89]  Satish Rao,et al.  A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts , 2004, IPCO.

[90]  Chris Walshaw,et al.  A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning , 2004, J. Glob. Optim..

[91]  Chris Walshaw,et al.  Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..

[92]  Burkhard Monien,et al.  Graph partitioning with the Party library: helpful-sets in practice , 2004, 16th Symposium on Computer Architecture and High Performance Computing.

[93]  Elad Hazan,et al.  O(/spl radic/log n) approximation to SPARSEST CUT in O/spl tilde/(n/sup 2/) time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[94]  Jurij Silc,et al.  Solving the mesh-partitioning problem with an ant-colony algorithm , 2004, Parallel Comput..

[95]  Peter Sanders,et al.  A simpler linear time 2/3-epsilon approximation for maximum weight matching , 2004, Inf. Process. Lett..

[96]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[97]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[98]  Stefan Schamberger,et al.  A Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves , 2004, PDCS.

[99]  B. Monien,et al.  Graph partitioning with the Party library: helpful-sets in practice , 2004 .

[100]  Konstantin Andreev,et al.  Balanced Graph Partitioning , 2004, SPAA '04.

[101]  Stefan Schamberger,et al.  On partitioning FEM graphs using diffusion , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[102]  Chao Yang,et al.  Identification of severe multiple contingencies in electric power networks , 2005, Proceedings of the 37th Annual North American Power Symposium, 2005..

[103]  Eric E. Aubanel,et al.  PaGrid: A Mesh Partitioner for Computational Grids , 2006, Journal of Grid Computing.

[104]  Henning Meyerhenke,et al.  Balancing Parallel Adaptive FEM Computations by Solving Systems of Linear Equations , 2005, Euro-Par.

[105]  Hao Li,et al.  Strategic Power Infrastructure Defense , 2005, Proceedings of the IEEE.

[106]  Ariel Felner,et al.  Finding optimal solutions to the graph partitioning problem with heuristic search , 2005, Annals of Mathematics and Artificial Intelligence.

[107]  Stefan Hougardy,et al.  A linear-time approximation algorithm for weighted matchings in graphs , 2005, TALG.

[108]  Douglas P. Gregor,et al.  The Parallel BGL : A Generic Library for Distributed Graph Computations , 2005 .

[109]  Ann B. Lee,et al.  Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parameterization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[110]  Rob H. Bisseling,et al.  Parallel hypergraph partitioning for scientific computing , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[111]  Dorothea Wagner,et al.  Partitioning graphs to speedup Dijkstra's algorithm , 2007, ACM J. Exp. Algorithmics.

[112]  Henning Meyerhenke,et al.  Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[113]  Leo Grady,et al.  Isoperimetric graph partitioning for image segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[114]  George Karypis,et al.  Multilevel algorithms for partitioning power-law graphs , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[115]  François Pellegrini,et al.  Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-level Framework , 2006, Euro-Par.

[116]  Francesc Comellas,et al.  A Multiagent Algorithm for Graph Partitioning , 2006, EvoWorkshops.

[117]  Bora Uçar,et al.  Task assignment in heterogeneous computing systems , 2006, J. Parallel Distributed Comput..

[118]  Chris Walshaw,et al.  JOSTLE: multilevel graph partitioning software: an overview , 2007 .

[119]  François Pellegrini,et al.  A Parallelisable Multi-level Banded Diffusion Scheme for Computing Balanced Partitions with Smooth Boundaries , 2007, Euro-Par.

[120]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[121]  Igor L. Markov,et al.  Hypergraph Partitioning and Clustering , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[122]  François Pellegrini,et al.  Scotch and libScotch 5.0 User's Guide , 2007 .

[123]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[124]  Ümit V. Çatalyürek,et al.  Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[125]  Berkant Barla Cambazoglu,et al.  Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids , 2007, J. Parallel Distributed Comput..

[126]  Pierre Chardaire,et al.  A PROBE-Based Heuristic for Graph Partitioning , 2007, IEEE Transactions on Computers.

[127]  Michael Armbruster,et al.  Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems , 2007 .

[128]  Peter Sanders,et al.  Engineering Algorithms for Approximate Weighted Matching , 2007, WEA.

[129]  Burkhard Monien,et al.  Approximation Algorithms for Multilevel Graph Partitioning , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[130]  Charles-Edmond Bichot,et al.  A New Method, the Fusion Fission, for the Relaxed k-way Graph Partitioning Problem, and Comparisons with Some Multilevel Algorithms , 2007, J. Math. Model. Algorithms.

[131]  Kevin J. Lang,et al.  An algorithm for improving graph partitions , 2008, SODA '08.

[132]  Thomas Sauerwald,et al.  A new diffusion-based multilevel algorithm for computing graph partitions of very high quality , 2008, IPDPS.

[133]  Huan Liu,et al.  Community evolution in dynamic multi-mode networks , 2008, KDD.

[134]  Eric Aubanel,et al.  Resource-Aware Load Balancing of Parallel Applications , 2008 .

[135]  George Karypis,et al.  Architecture Aware Partitioning Algorithms , 2008, ICA3PP.

[136]  Eric E. Aubanel,et al.  A linear solver for benchmarking partitioners , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[137]  Falk Schreiber,et al.  Analysis of Biological Networks , 2008 .

[138]  C. Walshaw.  JOSTLE : parallel multilevel graph-partitioning software – an overview , 2008 .

[139]  François Pellegrini,et al.  PT-Scotch: A tool for efficient parallel graph ordering , 2008, Parallel Comput..

[140]  William J. Knottenbelt,et al.  Parallel multilevel algorithms for hypergraph partitioning , 2008, J. Parallel Distributed Comput..

[141]  Michael Armbruster,et al.  A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem , 2008, IPCO.

[142]  Chen-Ching Liu,et al.  Power system reconfiguration based on multilevel graph partitioning , 2009, 2009 IEEE Bucharest PowerTech.

[143]  Chris Walshaw.  Variable partition inertia: Graph repartitioning and load balancing for adaptive meshes , 2009 .

[144]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[145]  Ilya Safro,et al.  Comparison of Coarsening Schemes for Multilevel Graph Partitioning , 2009, LION.

[146]  Henning Meyerhenke,et al.  Graph partitioning and disturbed diffusion , 2009, Parallel Comput..

[147]  Ümit V. Çatalyürek,et al.  A repartitioning hypergraph model for dynamic load balancing , 2009, J. Parallel Distributed Comput..

[148]  Silvio Lattanzi,et al.  On compressing social networks , 2009, KDD.

[149]  R. Mondaini.  Biomat 2009 - International Symposium on Mathematical and Computational Biology , 2010 .

[150]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[151]  Peter Sanders,et al.  Engineering a scalable high quality graph partitioner , 2009, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[152]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[153]  Onkar Sahni,et al.  Controlling Unstructured Mesh Partitions for Massively Parallel Simulations , 2010, SIAM J. Sci. Comput..

[154]  Jin-Kao Hao,et al.  An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

[155]  Elad Hazan,et al.  O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n2) Time , 2004, SIAM J. Comput..

[156]  Peter Sanders,et al.  Distributed Time-Dependent Contraction Hierarchies , 2010, SEA.

[157]  Keshav Pingali,et al.  Parallel Graph Partitioning on Multicore Architectures , 2010, LCPC.

[158]  Ilya Safro,et al.  A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints , 2009, Multiscale Model. Simul..

[159]  John Shalf,et al.  Exascale Computing Technology Challenges , 2010, VECPAR.

[160]  Vitaly Osipov,et al.  n-Level Graph Partitioning , 2010, ESA.

[161]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[162]  Peter Sanders,et al.  Goal-directed shortest-path queries using precomputed cluster distances , 2010, JEAL.

[163]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[164]  Bruce Hendrickson.  Graph Partitioning , 2011, Encyclopedia of Parallel Computing.

[165]  Andrew V. Goldberg,et al.  Graph Partitioning with Natural Cuts , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[166]  Andrew V. Goldberg,et al.  Customizable Route Planning , 2011, SEA.

[167]  Peter Sanders,et al.  Engineering Multilevel Graph Partitioning Algorithms , 2010, ESA.

[168]  Laxmikant V. Kalé,et al.  Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies , 2011, 2011 IEEE International Conference on High Performance Computing and Communications.

[169]  Philippe Galinier,et al.  An efficient memetic algorithm for the graph partitioning problem , 2011, Ann. Oper. Res..

[170]  Jin-Kao Hao,et al.  A Multilevel Memetic Approach for Improving Graph k-Partitions , 2011, IEEE Transactions on Evolutionary Computation.

[171]  Ilya Safro,et al.  Relaxation-based coarsening and multiscale graph organization , 2010, Multiscale Model. Simul..

[172]  Laxmikant V. Kalé,et al.  Avoiding hot-spots on two-level direct networks , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[173]  Torsten Hoefler,et al.  Generic topology mapping strategies for large-scale parallel architectures , 2011, ICS '11.

[174]  Ilya Safro,et al.  Multiscale approach for the network compression-friendly ordering , 2010, J. Discrete Algorithms.

[175]  Peter Widmayer,et al.  An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs , 2011, ESA.

[176]  Peter Widmayer,et al.  An O(n^4) time algorithm to compute the bisection width of solid grid graphs , 2011 .

[177]  James Cheng,et al.  Triangle listing in massive networks and its applications , 2011, KDD.

[178]  John R. Gilbert,et al.  The Combinatorial BLAS: design, implementation, and applications , 2011, Int. J. High Perform. Comput. Appl..

[179]  Ran Duan,et al.  Scaling algorithms for approximate and exact maximum weight matching , 2011, ArXiv.

[180]  F. Pellegrini,et al.  Adaptation au repartitionnement de graphes d'une méthode d'optimisation globale par diffusion , 2011 .

[181]  Jin-Kao Hao,et al.  An effective multilevel tabu search approach for balanced graph partitioning , 2011, Comput. Oper. Res..

[182]  Yong-Hyuk Kim,et al.  Genetic approaches for graph partitioning: a survey , 2011, GECCO '11.

[183]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[184]  Ilya Safro,et al.  Algebraic Distance on Graphs , 2011, SIAM J. Sci. Comput..

[185]  Ümit V. Çatalyürek,et al.  PaToH: Partitioning Tool for Hypergraphs , 1999 .

[186]  Rob H. Bisseling,et al.  Graph coarsening and clustering on the GPU , 2012, Graph Partitioning and Graph Clustering.

[187]  Peter Sanders,et al.  Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries , 2012, Euro-Par.

[188]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[189]  Henning Meyerhenke,et al.  Shape optimizing load balancing for MPI-parallel adaptive numerical simulations , 2012, Graph Partitioning and Graph Clustering.

[190]  Kamesh Madduri,et al.  Graph partitioning for scalable distributed graph computations , 2012, Graph Partitioning and Graph Clustering.

[191]  Joseph M. Hellerstein,et al.  Distributed GraphLab: A Framework for Machine Learning in the Cloud , 2012, Proc. VLDB Endow..

[192]  François Pellegrini,et al.  Scotch and PT-Scotch Graph Partitioning Software: An Overview , 2012 .

[193]  Rob H. Bisseling,et al.  Abusing a hypergraph partitioner for unweighted graph partitioning , 2012, Graph Partitioning and Graph Clustering.

[194]  Gabriel Kliot,et al.  Streaming graph partitioning for large distributed graphs , 2012, KDD.

[195]  Daniel Delling,et al.  Better Bounds for Graph Bisection , 2012, ESA.

[196]  Peter Sanders,et al.  Distributed Evolutionary Graph Partitioning , 2011, ALENEX.

[197]  Teck Chaw Ling,et al.  The impact of heterogeneous multi-core clusters on graph partitioning: an empirical study , 2012, Cluster Computing.

[198]  Andrew V. Goldberg,et al.  Exact Combinatorial Branch-and-Bound for Graph Bisection , 2012, ALENEX.

[199]  Peter Sanders,et al.  High quality graph partitioning , 2012, Graph Partitioning and Graph Clustering.

[200]  Thomas Sauerwald,et al.  Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning , 2012, Algorithmica.

[201]  Peter Sanders,et al.  Think Locally, Act Globally: Highly Balanced Graph Partitioning , 2013, SEA.

[202]  David Zhang,et al.  A survey of graph theoretical approaches to image segmentation , 2013, Pattern Recognit..

[203]  Mark E. J. Newman,et al.  Community detection and graph partitioning , 2013, ArXiv.

[204]  David A. Bader,et al.  Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings , 2013, Graph Partitioning and Graph Clustering.

[205]  William W. Hager,et al.  An exact algorithm for graph partitioning , 2013, Math. Program..

[206]  Miss H. P. Narkhede.  A Review on Graph Based Segmentation , 2013 .

[207]  Sivasankaran Rajamanickam,et al.  Scalable matrix computations on large scale-free graphs using 2D graph partitioning , 2013, 2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[208]  Mark E. J. Newman,et al.  Spectral methods for network community detection and graph partitioning , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[209]  Daniel Delling,et al.  Faster Customization of Road Networks , 2013, SEA.

[210]  Joel Nishimura,et al.  Restreaming graph partitioning: simple versatile algorithms for advanced balancing , 2013, KDD.

[211]  Vitaly Osipov,et al.  Efficient Parallel and External Matching , 2013, Euro-Par.

[212]  François Pellegrini,et al.  Static Mapping of Process Graphs , 2013 .

[213]  Padma Raghavan,et al.  Scalable parallel graph partitioning , 2013, 2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[214]  George Karypis,et al.  Multi-threaded Graph Partitioning , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[215]  B. Brandfass,et al.  Rank reordering for MPI communication optimization , 2013 .

[216]  Jennifer Widom,et al.  GPS: a graph processing system , 2013, SSDBM.

[217]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[218]  Charalampos E. Tsourakakis,et al.  FENNEL: streaming graph partitioning for massive scale graphs , 2014, WSDM.

[219]  Dennis Luxen,et al.  Candidate Sets for Alternative Routes in Road Networks , 2012, SOCS.

[220]  David A. Bader,et al.  Benchmarking for Graph Clustering and Partitioning , 2014, Encyclopedia of Social Network Analysis and Mining.

[221]  Emmanuel Jeannot,et al.  Process Placement in Multicore Clusters:Algorithmic Issues and Practical Techniques , 2014, IEEE Transactions on Parallel and Distributed Systems.

[222]  Peter Sanders,et al.  Advanced Coarsening Schemes for Graph Partitioning , 2012, ACM J. Exp. Algorithmics.

[223]  René van Bevern,et al.  On the Parameterized Complexity of Computing Balanced Partitions in Graphs , 2013, Theory of Computing Systems.

[224]  Peter Sanders,et al.  Partitioning Complex Networks via Size-Constrained Clustering , 2014, SEA.

[225]  Peter Sanders,et al.  (Semi-)External Algorithms for Graph Partitioning and Clustering , 2014, ALENEX.

[226]  Roland Glantz,et al.  Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures , 2014, 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing.

[227]  Ilya Safro,et al.  Multiscale network generation , 2012, 2015 18th International Conference on Information Fusion (Fusion).

[228]  Nadine Gottschalk,et al.  Vlsi Physical Design From Graph Partitioning To Timing Closure , 2016 .

[229]  Christian Schulz,et al.  Tree-Based Coarsening and Partitioning of Complex Networks , 2014, SEA.

[230]  N. Metropolis,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2017 .

[231]  James M. Kang,et al.  Space-Filling Curves , 2017, Encyclopedia of GIS.

[232]  Peter Sanders,et al.  Parallel Graph Partitioning for Complex Networks , 2017, IEEE Transactions on Parallel and Distributed Systems.

[233]  S. Bouallègue,et al.  A New Method , 2021, Black Power and the American Myth.

[234]  William W. Hager,et al.  A multilevel bilinear programming algorithm for the vertex separator problem , 2018, Comput. Optim. Appl..

[235]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .