ConceptTheory & Algos
Max-flow min-cut theorem
The theorem stating that the maximum flow in a network is equal to the capacity of the minimum cut.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Network flow3Cut2Augmenting path1Flow1Flow network1Graph cuts1Graphs and networks1Linear programming1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Srini Devadas
A theorem stating that the maximum value of a flow in a network is equal to the capacity of the minimum cut.Ryan O'Donnell
The principle stating that the maximum flow through a network is equal to the capacity of the minimum cut separating the source and sink.Gilbert Strang
The theorem stating that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the total capacity of the minimum cut that separates the source from the sink.
Lectures that assume it
1Connections
14The lectures that define it or assume it, and the concepts next to it.