Why it matters

Min-cut = max-flow. Foundational duality; many applications.

Advertisement

The architecture

s-t min cut = max flow.

Global min cut = Stoer-Wagner.

Karger's random cut.

Minimum cuts-t min cut= max flowGlobal min cutStoer-WagnerRandomKarger's algorithmMax-flow min-cut theorem; Stoer-Wagner for global; Karger's for random
Minimum cut.
Advertisement

How it works end to end

Max-flow min-cut theorem.

Stoer-Wagner global.

Karger's random.