Notes on Network Flow Algorithms
Lecture Slides I (PDF)
Lecture Slides II (PDF)
Lecture Slides III (PDF)
Screencast: Flow Networks, Max Flows, and Min Cuts [7.1-7.2] (MP4)
Screencast: The Ford-Fulkerson Algorithm for Calculating Max Flow / Min Cut [7.1] (MP4)
Screencast: The Max-Flow, Min-Cut Theorem and The Efficiency of the Ford-Fulkerson Algorithm [7.2] (MP4)
Screencast: Better Augmenting Paths and An Efficient Version of the Ford-Fulkerson Algorithm [7.3] (MP4)
Screencast: The Bipartite Matching Problem, Part I [7.5] (MP4)
Screencast: The Bipartite Matching Problem, Part II [7.5] (MP4)
Screencast: Extensions to the Maximum Flow Problem [7.7] (MP4)
Screencast: Survey Design and Airline Scheduling [7.8-7.9] (MP4)
Screencast: Image Segmentation [7.10] (MP4)
Screencast: Baseball Elimination [7.12] (MP4)