南京大学：《高级算法 Advanced Algorithms》课程教学资源（课件讲稿）01 Introduction - Min-Cut and Max-Cut（尹⼀通）

Karger's Min-Cut Algorithm ·multigraph G(V,E) Karger's Algorithm: while V>2 do: pick random e∈E; contract(e); return remaining edges;

• multigraph G(V, E) Karger’s Min-Cut Algorithm Karger’s Algorithm: while do: pick random ; contract ; return remaining edges; |V| > 2 e ∈ E (e)

Karger's Min-Cut Algorithm ·multigraph G(V,E) Karger's Algorithm: while V>2 do: pick random e∈E; contract(e); return remaining edges;

• multigraph G(V, E) Karger’s Min-Cut Algorithm Karger’s Algorithm: while do: pick random ; contract ; return remaining edges; |V| > 2 e ∈ E (e)

Karger's Min-Cut Algorithm ·multigraph G(V,E) Karger's Algorithm: while V>2 do: pick random e∈E; contract(e); return remaining edges;

• multigraph G(V, E) Karger’s Min-Cut Algorithm Karger’s Algorithm: while do: pick random ; contract ; return remaining edges; |V| > 2 e ∈ E (e)

Karger's Min-Cut Algorithm ·multigraph G(V,E) Karger's Algorithm: while V>2 do: pick random e∈E; contract(e); return remaining edges;

• multigraph G(V, E) Karger’s Min-Cut Algorithm Karger’s Algorithm: while do: pick random ; contract ; return remaining edges; |V| > 2 e ∈ E (e)

Karger's Min-Cut Algorithm ·multigraph G(V,E) Karger's Algorithm: while V>2 do: pick random e∈E; contract(e); return remaining edges;

• multigraph G(V, E) Karger’s Min-Cut Algorithm Karger’s Algorithm: while do: pick random ; contract ; return remaining edges; |V| > 2 e ∈ E (e)