Analyzed about 6 hours ago
KaHyPar is a multilevel hypergraph partitioning framework for optimizing the cut- and the (λ − 1)-metric. It supports both recursive bisection and direct k-way partitioning. KaHyPar instantiates the multilevel approach in its most extreme version, removing only a single vertex in every level of the
... [More]
hierarchy. By using this very fine grained n-level approach combined with strong local search heuristics, it computes solutions of very high quality. Its algorithms and detailed experimental results are presented in several research publications. [Less]
35.7K
lines of code
3
current contributors
4 months
since last commit
0
users on Open Hub