[DMANET] mtKaHIP v1.00 -- Multithreaded Karlsruhe High Quality Partitioning

Release of mtKaHiP v1.00
------------------------------------

We are proud to announce the release of a major extension 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 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. In this release, we provide the shared-memory parallel
multilevel algorithm mt-KaHIP which is due to Yaroslav Akhremtsev.

The code is available under MIT Licence.

* open source implementation / website
https://kahip.github.io

* github orga
https://github.com/KaHIP

* github link
https://github.com/KaHIP/mt-KaHIP

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

Yaroslav Akhremtsev*, Peter Sanders*, Christian Schulz**
* Karlsruhe Institute of Technology (KIT)
** Heidelberg University
**********************************************************
*
* 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/
*
**********************************************************