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 hypergraph partitioning framework on a wide range of problems.
@InProceedings{shaydulin_et_al:LIPIcs.SEA.2018.2, author = {Shaydulin, Ruslan and Safro, Ilya}, title = {{Aggregative Coarsening for Multilevel Hypergraph Partitioning}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {2:1--2:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.2}, URN = {urn:nbn:de:0030-drops-89371}, doi = {10.4230/LIPIcs.SEA.2018.2}, annote = {Keywords: hypergraph partitioning, multilevel algorithms, coarsening, matching, combinatorial scientific computing} }
Feedback for Dagstuhl Publishing