Karger’s Randomized Contraction is a probabilistic algorithm used to find the minimum cut of a connected, undirected graph. The main idea of the algorithm is to randomly contract edges of the graph until only two vertices remain, at which point the edges between these two vertices represent a cut. The algorithm works as follows:
The algorithm is efficient with a time complexity of and can be repeated multiple times to increase the probability of finding the absolute minimum cut. Due to its random nature, it may not always yield the correct answer in a single run, but it provides a good approximation with a high probability when executed multiple times.
Start your personalized study experience with acemate today. Sign up for free and find summaries and mock exams for your university.