Advanced Coarsening Schemes for Graph Partitioning - Ilya ... - KIT

More documents

Recommendations

Info

ɛ-Balanced Graph Partitioning Partition graph G = (V , E, c : V → R>0, ω : E → R>0) into k disjoint blocks s.t. 1 + ɛ total node weight of each block ≤ total node weight k total weight of cut edges as small as possible Applications: FEM, linear equation systems, VLSI design, route planning, . . . 4 Ilya Safro, Peter Sanders, Christian Schulz: Advanced Coarsening Schemes for Graph Partititoning Department of Informatics Institute for Theoretical Computer Science, Algorithmics II
Multi-Level Graph Partitioning Successful in existing systems: Metis, Scotch, Jostle,. . . , KaPPa, KaSPar, KaFFPa, KaFFPaE 5 Ilya Safro, Peter Sanders, Christian Schulz: Advanced Coarsening Schemes for Graph Partititoning Department of Informatics Institute for Theoretical Computer Science, Algorithmics II
Page 1 and 2: 1 Advanced Coarsening Schemes for G
Page 3 and 4: Motivation Social Networks SNWs are
Page 5: Motivation Social Networks Graph Pa
Page 9 and 10: Algebraic Distance Relaxation Proce
Page 11 and 12: Algebraic Distance Example - random
Page 13 and 14: Stationary iterative relaxation rew
Page 15 and 16: Stationary iterative relaxation rew
Page 17 and 18: Coarse Nodes C-points Selection fin
Page 19 and 20: Coarse Nodes classical AMG interpol
Page 21 and 22: Coarse Nodes modified AMG interpola
Page 23 and 24: Modified Algorithm Likelihood for v
Page 29 and 30: Experimental Results Social Network
Page 31 and 32: Experimental Results Potentially Ha
Page 33 and 34: Conclusion Experiments algebraic di

Advanced Coarsening Schemes for Graph Partitioning - Ilya ... - KIT

Create successful ePaper yourself

Delete template?

Save as template?