A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)
-
Updated
Apr 24, 2020 - C++
A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)
This repository implements the Karger's Algorithm to find the minimum cut for a given graph.
Analysis of Algorithms, Assignment III.
Add a description, image, and links to the min-cut topic page so that developers can more easily learn about it.
To associate your repository with the min-cut topic, visit your repo's landing page and select "manage topics."