[DMANET] KaHIP -- Karlsruhe High Quality Graph Partitioning

Release of KaHIP v0.53
----------------------

We are proud to announce the release of our graph partitioning framework
KaHIP (Karlsruhe High Quality Graph Partitioning).
KaHIP is a family of high quality graph partitioning programs. It
contains various graph partitioning algorithms:


- KaFFPa (Karlsruhe Fast Flow Partitioner) which is a sequential graph
partitioner that can be configured to either achieve the best known
partitions for many standard benchmark instances or to be a good
tradeoff between partition quality and running time

- KaFFPaE (KaFFPaEvolutionary), a distributed parallel evolutionary
algorithm that uses KaFFPa to provide combine and mutation operations.
It is able to improve the best known partitioning results for many
inputs in a short amount of time

- KaBaPE (Karlsruhe Balanced Partitioner Evolutionary) which extends the
evolutionary algorithm by novel local search algorithms that reduce the
problem of combining local searches to finding negative cycles in a graph


Moreover, the framework provides the possibility to compute a k-way node
separator from a given k-partition of the graph.
The software is released under the GPL 3.0 Licence.

* open source implementation / website
http://algo2.iti.kit.edu/documents/kahip/index.html

We are glad for any comments and error reports (or even bug fixes) that
you send us.


Peter Sanders and Christian Schulz,
Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************