A Course in Graduate Algorithms

Designed by Bo Waggoner for the University of Colorado, Boulder CSCI 5454: Design and Analysis of Algorithms.



Lecture 5: Max Flow and Min Cut




Videos - Original Speed


Section 1: The Max Flow Problem


Direct download

Section 2: Residual Graph, Augmenting Paths, and Ford Fulkerson


Direct download

Section 3: Max Flows and Min Cuts


Direct download

Section 4: Edmonds-Karp


Direct download

Section 5: Bipartite Matching


Direct download






Videos - 1.4x Speed


Section 1: The Max Flow Problem (1.4x)


Direct download

Section 2: Residual Graph, Augmenting Paths, and Ford Fulkerson (1.4x)


Direct download

Section 3: Max Flows and Min Cuts (1.4x)


Direct download

Section 4: Edmonds-Karp (1.4x)


Direct download

Section 5: Bipartite Matching (1.4x)


Direct download