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

More documents

Recommendations

Info

Experimental Results Potentially Hard Graphs potentially hard mixtures (star-like structures) mixtures of snw, fem graphs, VLSI, ... S 0, . . . , St connected center S 0 by ≤ 3% random edges ECO-ALG AMG-ECO ECO-ALG AMG-ECO 23 Ilya Safro, Peter Sanders, Christian Schulz: Advanced Coarsening Schemes for Graph Partititoning STRONG AMG STRONG AMG k quality uncoar. time quality uncoar. time 2 1.18 0.55 1.15 2.11 4 1.23 0.64 1.13 1.69 8 1.08 0.98 1.05 1.37 Department of Informatics Institute for Theoretical Computer Science, Algorithmics II
Conclusion Experiments algebraic distance and AMG help on irregular instances on regular instances (FEM, ...) no significant difference Further Material in the Paper more details more experiments Future Work apply AMG and algebraic distance to other multilevel algorithms implementation within KaFFPa Lunch 24 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 and 6: Motivation Social Networks Graph Pa
Page 7 and 8: Multi-Level Graph Partitioning Succ
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: Experimental Results Potentially Ha

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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?