Aggregative Coarsening for Multilevel Hypergraph Partitioning

Ruslan Shaydulin, Ilya Safro, Marc Herbstritt
2018 Symposium on Experimental and Efficient Algorithms  
Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In this paper we introduce two novel aggregative coarsening schemes and incorporate them within state-of-the-art hypergraph partitioner Zoltan. Our coarsening schemes are inspired by the algebraic multigrid and stable matching approaches. We demonstrate the effectiveness of the developed schemes as a part of multilevel
more » ... rgraph partitioning framework on a wide range of problems. ACM Subject Classification Mathematics of computing → Hypergraphs, Mathematics of computing → Graph algorithms, Mathematics of computing → Matchings and factors
doi:10.4230/lipics.sea.2018.2 dblp:conf/wea/ShaydulinS18 fatcat:sjetiftqhrfnfhkwenrpxxi4we