Karger's Algorithm (Randomized Min-Cut Algorithm)

In this video, we explore a very simple randomized algorithm called Karger's Algorithm. The problem of finding the min-cut in a graph is well known and has been solved in numerous ways. One famous solution is related to the "Max flow min cut" theorem in which you find the maximum flow in a graph, and that indicates where the min-cut is.

Flow algorithms tend to be a bit complex. Karger's algorithm is much simpler in that it relies on contracting edges in a graph! Learn how to analyze Karger's Algorithm and determine its probability of finding a min-cut!

[fitking]

Brother Your way of teaching is good but we cant see anything. I suggest you to use a white board with a black marker and a good camera angle so we can see properly. More power to you bro.

[kumaramandeep]

Nicely explained. However, using white chalk would've been better. Best wishes.