Karlsruhe High Quality Graph Partitioning
Christian Schulz via dmanet <[email protected]>
| Newsgroups | gmane.science.mathematics.discrete |
|---|---|
| Message-ID | <616c6635-47c9-4f1f-93d9-7aad2d220daa@informatik.uni-heidelberg.de> |
Release of KaHiP v3.21 ------------------------------------ We are proud to announce the release of an 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 now provide Python support, e.g. KaHIP can be install and used via ``pip install kahip''. *** The code is available under MIT Licence. * github link https://github.com/KaHIP/KaHIP We are glad for any comments, stars and error reports (or even bug fixes) that you send us. Christian Schulz ********************************************************** * * Contributions to be spread via DMANET are submitted to * * [email protected] * * 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/ * **********************************************************