Lecture 15: Max-Flow Min-Cut Theorem
MIT OpenCourseWare · 77:51
This lecture proves the max-flow min-cut theorem by writing a linear program for maximum flow, taking its dual, and showing that an optimal dual solution is a minimum cut (via an averaging argument that fractional dua...