Lecture 15: Max-Flow Min-Cut Theorem
We explain the problem of maximum flow. First, we show that the maximum flow is always less than the minimum cut. We next write down the linear program for maximum flow and take the dual. It turns out that this gives the minimum cut.
Course Info
Instructors
Departments
As Taught In
Spring
2024
Level
Topics
Learning Resource Types
edit_note
Editable Files
notes
Lecture Notes
theaters
Lecture Videos
assignment
Problem Sets
