kahypar.org - KaHyPar - Karlsruhe Hypergraph Partitioning | KaHyPar is a multilevel hypergraph partitioning framework providing direct k-way a

home > domains > kahypar.org

Description: KaHyPar is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.

Example domain paragraphs

KaHyPar is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.

View the Project on GitHub kahypar/kahypar

Hypergraphs are a generalization of graphs, where each (hyper)edge (also called net) can connect more than two vertices. The k -way hypergraph partitioning problem is the generalization of the well-known graph partitioning problem: partition the vertex set into k disjoint blocks of bounded size (at most 1 + ε times the average block size), while minimizing an objective function defined on the nets.

Links to kahypar.org (1)

• schulzchristian.github.io Univ.-Prof. PD. Dr. Christian Schulz