------------------------------------
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:
- (Distributed Parallel) Edge Partitioning Algorithms: Our new
algorithms to compute edge partitions of graphs.
- Rudimentary 64bit Support
- Switched to MIT Licence
* 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.
Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier,
Darren Strash
Karlsruhe Institute of Technology (KIT)
University of Vienna
Hamilton College
**********************************************************
*
* 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
