Algorithms: Design and Analysis Part I - Stanford Programming #3 Compute a minimum cut of the graph G Karger's Min cut randomized algorithm: Randomly contract edges until left with a pair of nodes