KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.
Skipping v1.3.4
to align the version with the python package version
This release contains some performance bug fixes that caused KaHyPar to become slow when partitioning instances using a large imbalance factor. Furthermore, this will be the last release that does not include the advanced balancing strategies for partitioning weighted instances (see https://github.com/kahypar/kahypar/pull/70).
As described in our upcoming SEA paper and in the corresponding technical report [1], KaHyPar now uses Weighted Hyperflow Cutter (WHFC) for flow-based refinement. The previous flow-based refinement algorithm [2,3] has been removed to reduce code complexity and compilation time.
[1] https://arxiv.org/abs/2003.12110 [2] https://dl.acm.org/doi/abs/10.1145/3329872 [3] https://drops.dagstuhl.de/opus/volltexte/2018/8936/
This KaHyPar release contains the source code that was used in the dissertation of Sebastian Schlag.