Code-Release: Vienna Minimum Cuts v1.00
Alexander Noe <[email protected]> Thu, 10 Jan 2019 15:28:19 +0100
| Newsgroups | gmane.comp.mathematics.csc |
|---|---|
| Message-ID | <[email protected]> |
This is a multi-part message in MIME format.
--===============5073665793274755888==
Content-Type: multipart/alternative;
boundary="------------018200CD82B1BB7468B4D1DA"
Content-Language: en-GB
This is a multi-part message in MIME format.
--------------018200CD82B1BB7468B4D1DA
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit
Release of VieCut v1.00
------------------------------------
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)//
--------------018200CD82B1BB7468B4D1DA
Content-Type: text/html; charset=utf-8
Content-Transfer-Encoding: 8bit
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
Release of VieCut v1.00<br>
<div class="moz-forward-container">
<div class="moz-text-html" lang="x-unicode">
------------------------------------<font size="-2"><br>
</font><br>
We are proud to announce the release of our shared-memory
minimum cut library VieCut (Vienna Minimum Cuts).<br>
<br>
Our library offers both sequential and shared-memory parallel
code for our VieCut heuristic minimum cut algorithm [HNSS'18]. <br>
<br>
We also give a fast and scalable shared-memory exact algorithm
for the minimum cut problem [HNS'19].<br>
<br>
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.<br>
<br>
Our source code is licensed under the MIT licence.<br>
We hope that our library proves useful for researchers and
practitioners.<br>
<br>
GitHub<br>
<a href="https://github.com/alexnoe/VieCut"
rel="noreferrer

 noreferrer noreferrer"
target="_blank" moz-do-not-send="true">https://github.com/alexnoe/VieCut</a><br>
<br>
Website<br>
<a href="http://viecut.taa.univie.ac.at/" target="_blank"
rel="noreferrer" moz-do-not-send="true">http://viecut.taa.univie.ac.at/</a><br>
<br>
Best regards,<br>
Monika Henzinger, Alexander Noe, Christian Schulz, and Darren
Strash<br>
<br>
References:<br>
HNSS'18 - <em>Henzinger, M., Noe, A., Schulz, C. and Strash,
D., Practical Minimum Cut Algorithms. (appeared at ALENEX'18)</em><br>
HNS'19 -<em> </em><em><em>Henzinger, M., Noe, A. and Schulz,
C., Shared-memory Exact Minimum Cuts. (will appear at
IPDPS'19)</em></em><br>
</div>
</div>
</body>
</html>
--------------018200CD82B1BB7468B4D1DA--
--===============5073665793274755888==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
_______________________________________________
Csc mailing list
[email protected]
https://lists.purdue.edu/mailman/listinfo/csc
--===============5073665793274755888==--