Karger's Min-Cut Theorem states that in a connected undirected graph, the minimum cut (the smallest number of edges that, if removed, would disconnect the graph) can be found using a randomized algorithm. This algorithm works by repeatedly contracting edges until only two vertices remain, which effectively identifies a cut. The key insight is that the probability of finding the minimum cut increases with the number of repetitions of the algorithm. Specifically, if the graph has minimum cuts, the probability of finding one of them after runs is at least , where is the number of vertices in the graph. This theorem not only provides a method for finding minimum cuts but also highlights the power of randomization in algorithm design.
Start your personalized study experience with acemate today. Sign up for free and find summaries and mock exams for your university.