南京大学：《随机算法 Randomized Algorithms》课程教学资源（课件讲稿）Min-Cut

Karger's min-cut Algorithm MinCut multigraph G(V,E)) while IV>2 do choose a uniform e∈E; contract(e); return remaining edges;

Karger’s min-cut Algorithm MinCut ( multigraph G(V,E) ) while |V|>2 do • choose a uniform e ∈E ; contract(e); return remaining edges;

Karger's min-cut Algorithm MinCut multigraph G(V,E)) while IV>2 do choose a uniform e∈E; contract(e); return remaining edges;

Karger’s min-cut Algorithm MinCut ( multigraph G(V,E) ) while |V|>2 do • choose a uniform e ∈E ; contract(e); return remaining edges;

Karger's min-cut Algorithm MinCut multigraph G(V,E)) while IV>2 do choose a uniform e∈E; contract(e); return remaining edges;

Karger’s min-cut Algorithm MinCut ( multigraph G(V,E) ) while |V|>2 do • choose a uniform e ∈E ; contract(e); return remaining edges;

Karger's min-cut Algorithm MinCut multigraph G(V,E)) while IV>2 do choose a uniform e∈E; contract(e); return remaining edges;

Karger’s min-cut Algorithm MinCut ( multigraph G(V,E) ) while |V|>2 do • choose a uniform e ∈E ; contract(e); return remaining edges;

Karger's min-cut Algorithm MinCut multigraph G(V,E)) while IV>2 do choose a uniform e∈E; contract(e); return remaining edges; edges returned

edges returned Karger’s min-cut Algorithm MinCut ( multigraph G(V,E) ) while |V|>2 do • choose a uniform e ∈E ; contract(e); return remaining edges;