ConceptMathematics
Min-cut / max-flow relation via LP
Setting edge variables alpha to 0 or 1 demonstrates that the optimal dual variables correspond to a cut in the network.
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.
Dual linear program for max flow1Graph cuts1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.