Skip to content

Commit

Permalink
Update README
Browse files Browse the repository at this point in the history
  • Loading branch information
@DanielSeemaier
DanielSeemaier committed May 17, 2021
1 parent b944711 commit ed7e5fb
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.MD
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

The graph partitioning software KaMinPar -- Karlsruhe Minimal Graph Partitioning.

KaMinPar is a shared-memory parallel heuristic to solve the graph partitioning problem: divide a graph into k disjoint blocks of roughly equal weight while
KaMinPar is a shared-memory parallel tool to heuristically solve the graph partitioning problem: divide a graph into k disjoint blocks of roughly equal weight while
minimizing the number of edges between blocks.
Competing algorithms are mostly evaluated for small values of k. If k is large, they often compute highly imbalance solutions, solutions of low quality or suffer excessive running time.
KaMinPar substantially mitigates these problems.
Expand Down

0 comments on commit ed7e5fb

Please sign in to comment.