Graph Partitioning and Graph Clustering

We present an overview over our graph partitioners KaFFPa (Karlsruhe Fast Flow Partitioner) and KaFFPaE (KaFFPa Evolutionary). KaFFPa is a multilevel graph partitioning algorithm which on the one hand uses novel local improvement algorithms based on max-flow and min-cut computations and more localized FM searches and on the other hand uses more sophisticated global search strategies transferred from multi-grid linear solvers. KaFFPaE is a distributed evolutionary algorithm to solve the Graph Partitioning Problem. KaFFPaE uses KaFFPa and provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs.

[1]  F. Chung,et al.  Connected , 2020, Connected.

[2]  Tang Xianchao,et al.  Dolphin social network , 2014 .

[3]  Hristo Djidjev,et al.  Scalable and Accurate Graph Clustering and Community Structure Detection , 2013, IEEE Transactions on Parallel and Distributed Systems.

[4]  Marco Rosa,et al.  Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks , 2010, WWW.

[5]  Hristo Djidjev,et al.  A fast multilevel algorithm for graph clustering and community detection , 2007, 0707.2387.

[6]  Hristo Djidjev,et al.  A SCALABLE MULTILEVEL ALGORITHM FOR COMMUNITY STRUCTURE DETECTION , 2007 .

[7]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Andrzej Rucinski,et al.  Random graphs , 2006, SODA.

[10]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

[11]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Sebastiano Vigna,et al.  UbiCrawler: a scalable fully distributed Web crawler , 2004, Softw. Pract. Exp..

[13]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[14]  M. Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[17]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

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

[19]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[20]  R. Ulanowicz,et al.  The Seasonal Dynamics of The Chesapeake Bay Ecosystem , 1989 .

[21]  Vipin Kumar,et al.  Multilevel Graph Partitioning Schemes , 1995, ICPP.

[22]  A. Andrew,et al.  Emergence of Scaling in Random Networks , 2022 .