CSE 550 (2022, Fall): 3.4 Max-Flow-Min-Cut Theorem

Part 4 of Lecture 3: Network Flows and Matchings. This lecture connects the primal LP derived in the previous lecture to the Minimum-Cut problem and uses the primal–dual pair to prove the Max-Flow-Min-Cut theorem.