"Comparison of Coarsening Schemes for Multilevel Graph Partitioning"
C. Chevalier and I. Safro
Preprint Version: [pdf]
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many
multilevel schemes have been introduced as a practical tool to solve this problem. A multilevel algorithm may be viewed as a process of graph
topology learning at different scales in order to generate a better approximation for any approximation method incorporated at the uncoarsening stage in the framework. In this work we compare two multilevel frameworks based on the geometric and the algebraic multigrid schemes for the partitioning problem.