Affiliation:
1. Clemson University, Clemson SC, USA
2. Karlsruhe Institute of Technology, Karlsruhe, Germany
Abstract
The graph partitioning problem is widely used and studied in many practical and theoretical applications. Today, multilevel strategies represent one of the most effective and efficient generic frameworks for solving this problem on large-scale graphs. Most of the attention in designing multilevel partitioning frameworks has been on the refinement phase. In this work, we focus on the coarsening phase, which is responsible for creating structures similar to the original but smaller graphs. We compare different matching- and AMG-based coarsening schemes, experiment with the algebraic distance between nodes, and demonstrate computational results on several classes of graphs that emphasize the running time and quality advantages of different coarsening schemes.
Funder
CSCAPES Institute, a DOE project
DFG SA 933/10-1
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献