51:12

R7. Network Flow and Matching

1:20:15

4. Divide & Conquer: van Emde Boas Trees

1:22:58

13. Incremental Improvement: Max Flow, Min Cut

1:21:52

6. Randomization: Matrix Multiply, Quicksort

21:56

Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)

1:15:56

Ses 2: Present Value Relations I

1:16:30

A Second Course in Algorithms (Lecture 3: The Push-Relabel Algorithm for Maximum Flow)

1:20:12

Lecture 2: Experimental Facts of Life