CMU Randomized Algorithms

Randomized Algorithms, Carnegie Mellon: Spring 2011

Karger’s min-cut algorithm

Hey, it may be useful for today’s lecture if you have a quick read over Karger’s randomized algorithm for min-cuts. Just the basic algorithm and analysis—we won’t need the improved Karger-Stein variant.


Comments are closed.

%d bloggers like this: