VieCut 1.00 - Shared-memory Minimum Cuts
-
Updated
Feb 19, 2023 - C++
VieCut 1.00 - Shared-memory Minimum Cuts
Academical implementation of Karger's Algorithm in O(mα(n) + n) and Karger-Stein algorithm in O((mα(n) + n) log(n)) using the Union-Find data structure.
A solver to the minimum cut problem of a graph.
Implement with C++ the karger's algorithm which designed to find a minimum cut in a connected graph with high probability.
Implementation of relabel-to-front algorithm for Algorithms class
Add a description, image, and links to the minimum-cut topic page so that developers can more easily learn about it.
To associate your repository with the minimum-cut topic, visit your repo's landing page and select "manage topics."