------------------------------------
We are proud to announce the release of a major update 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. Since the last major release we added:
- ParHIP: distributed memory parallel partitioning techniques designed
to partition hierarchically structured networks such as web graphs or
social networks.
- Mapping Algorithms: new algorithms to map the blocks of a partition
onto a specified processor network in order to minimize overall
communication time.
The software is released under the GPL 2.0 License.
* open source implementation / website
http://algo2.iti.kit.edu/kahip
* github
https://github.com/schulzchristian/KaHIP
We are glad for any comments and error reports (or even bug fixes) that
you send us.
Henning Meyerhenke, Peter Sanders, Christian Schulz, Jesper Larsson Träff
Karlsruhe Institute of Technology (KIT)
University of Vienna
Technical University Vienna
**********************************************************
*
* 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/
*
**********************************************************
Posts
