Project Summary
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 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.
In a Nutshell, KaHyPar - Karlsruhe Hypergraph Partit...
- ...
- ...
-
...
has a well established, mature codebase
maintained by a average size development team
with increasing Y-O-Y commits -
...
took an estimated 9 years of effort (COCOMO model)
starting with its first commit in November, 2013
ending with its most recent commit 3 months ago
Quick Reference
GNU General Public License v3.0 only
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Use Patent Claims
Forbidden
Sub-License
Hold Liable
Required
Distribute Original
Disclose Source
Include Copyright
State Changes
Include License
Include Install Instructions
These details are provided for information only. No information here is legal advice and should not be used as such.
Project Security
Vulnerabilities per Version ( last 10 releases )
There are no reported vulnerabilities
Project Vulnerability Report
Security Confidence Index
Vulnerability Exposure Index
Did You Know...
-
...
use of OSS increased in 65% of companies in 2016
-
...
you can embed statistics from Open Hub on your site
-
...
55% of companies leverage OSS for production infrastructure
-
...
you can subscribe to e-mail newsletters to receive update from the Open Hub blog
30 Day SummaryMay 10 2026 — Jun 9 2026
|
12 Month SummaryJun 9 2025 — Jun 9 2026
|
