KaFFPa

graph partitioners KaFFPa (Karlsruhe Fast Flow Partitioner)

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 6 articles )

Showing results 1 to 6 of 6.
Sorted by year (citations)

  1. Meyerhenke, Henning; Sanders, Peter; Schulz, Christian: Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (2016)
  2. Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.: An exact combinatorial algorithm for minimum graph bisection (2015)
  3. Younes, Ahmed: A bounded-error quantum polynomial-time algorithm for two graph bisection problems (2015)
  4. Ceselli, Alberto; Colombo, Fabio; Cordone, Roberto; Trubian, Marco: Employee workload balancing by graph partitioning (2014)
  5. Colombo, Fabio; Cordone, Roberto; Trubian, Marco: Column-generation based bounds for the homogeneous areas problem (2014)
  6. Sanders, Peter; Schulz, Christian: Engineering multilevel graph partitioning algorithms (2011)