k-way Hypergraph Partitioning via n-Level Recursive Bisection

DOI10.1137/1.9781611974317.5zbMath1430.68239arXiv1511.03137OpenAlexW2963489471WikidataQ60043533 ScholiaQ60043533MaRDI QIDQ5232546

Peter Sanders, Henning Meyerhenke, Tobias Heuer, Vitali Henne, Sebastian Schlag, Christian Schulz

Publication date: 12 September 2019

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

Full work available at URL: https://arxiv.org/abs/1511.03137

Mathematics Subject Classification ID

Analysis of algorithms (68W40) 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

Hypergraph Cuts with General Splitting Functions, Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Unnamed Item, A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning

Uses Software

• KaHyPar