Karger's Min-Cut Algorithm ·multigraph G(V,E) Karger's Algorithm: whileV>2 do: pick random e∈E; contract(e); return remaining edges; random:uniformly and independently at randomKarger’s Algorithm: while do: pick random ; contract ; return remaining edges; |V| > 2 e ∈ E (e) • multigraph G(V, E) Karger’s Min-Cut Algorithm random: uniformly and independently at random