License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2018.2
URN: urn:nbn:de:0030-drops-89371
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8937/
Shaydulin, Ruslan ;
Safro, Ilya
Aggregative Coarsening for Multilevel Hypergraph Partitioning
Abstract
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.
BibTeX - Entry
@InProceedings{shaydulin_et_al:LIPIcs:2018:8937,
author = {Ruslan Shaydulin and Ilya Safro},
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 = {Gianlorenzo D'Angelo},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8937},
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}
}
|
Keywords: |
|
hypergraph partitioning, multilevel algorithms, coarsening, matching, combinatorial scientific computing |
|
Collection: |
|
17th International Symposium on Experimental Algorithms (SEA 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
19.06.2018 |
