13. Incremental Improvement: Max Flow, Min Cut
1:22:32
14. Incremental Improvement: Matching
50:05
6. Monte Carlo Simulation
1:22:10
12. Greedy Algorithms: Minimum Spanning Tree
21:56
Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)
1:20:15
4. Divide & Conquer: van Emde Boas Trees
14:02
Maximum flow Minimum Cut Algorithm
8:11
Proof of Max-Flow Min-Cut Theorem and Ford Fulkerson Correctness
3:13:20