Sciweavers

Share
LION
2009
Springer

Comparison of Coarsening Schemes for Multilevel Graph Partitioning

9 years 3 months ago
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
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.
Cédric Chevalier, Ilya Safro
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where LION
Authors Cédric Chevalier, Ilya Safro
Comments (0)
books