------------------------------------
We are proud to announce the release of our shared-memory minimum cut
library VieCut (Vienna Minimum Cuts).
Our library offers both sequential and shared-memory parallel code for
our VieCut heuristic minimum cut algorithm [HNSS'18].
We also give a fast and scalable shared-memory exact algorithm for the
minimum cut problem [HNS'19].
Additionally, the repository contains efficient implementations of other
algorithms, such as the Algorithm of Nagamochi, Ono and Ibaraki; the
Algorithm of Matula; and the Algorithm of Karger and Stein.
Our source code is licensed under the MIT licence.
We hope that our library proves useful for researchers and practitioners.
GitHub
https://github.com/alexnoe/VieCut
Website
http://viecut.taa.univie.ac.at/
Best regards,
Monika Henzinger, Alexander Noe, Christian Schulz, and Darren Strash
References:
HNSS'18 - /Henzinger, M., Noe, A., Schulz, C. and Strash, D., Practical
Minimum Cut Algorithms. (appeared at ALENEX'18)/
HNS'19 -////Henzinger, M., Noe, A. and Schulz, C., Shared-memory Exact
Minimum Cuts. (will appear at IPDPS'19)//
**********************************************************
*
* 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
