KaHIP - Karlsruhe High Quality Partitioning - is a family of graph partitioning programs. It includes KaFFPa (Karlsruhe Fast Flow Partitioner), which is a multilevel graph partitioning algorithm, in its variants Strong, Eco and Fast, KaFFPaE (KaFFPaEvolutionary) which is a parallel evolutionary algorithm that uses KaFFPa to provide combine and mutation operations, as well as KaBaPE which extends the evolutionary algorithm. Moreover, specialized techniques are included to partition road networks (Buffoon), to output a vertex separator from a given partition or techniques geared towards efficient partitioning of social networks.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Christian Schulz, Jesper Larsson Traeff: VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide (2017) arXiv
- Meyerhenke, Henning; Sanders, Peter; Schulz, Christian: Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (2016)
- Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.: An exact combinatorial algorithm for minimum graph bisection (2015)
- Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz: k-way Hypergraph Partitioning via n-Level Recursive Bisection (2015) arXiv
- Younes, Ahmed: A bounded-error quantum polynomial-time algorithm for two graph bisection problems (2015)
- Duan, Ran; Pettie, Seth: Linear-time approximation for maximum weight matching (2014)
- Safro, Ilya; Sanders, Peter; Schulz, Christian: Advanced coarsening schemes for graph partitioning (2014)
- Sanders, Peter; Schulz, Christian: Distributed evolutionary graph partitioning (2012)