Engineering a direct k-way Hypergraph Partitioning Algorithm

DOI10.1137/1.9781611974768.3zbMath1429.68162OpenAlexW2570248857WikidataQ60043532 ScholiaQ60043532MaRDI QIDQ5232562

Sebastian Schlag, Peter Sanders, Tobias Heuer, Yaroslav Akhremtsev

Publication date: 12 September 2019

Published in: 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974768.3

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Persistent hyperdigraph homology and persistent hyperdigraph Laplacians, Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Unnamed Item, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning

Uses Software

• KaHyPar