Video details loaded
HomeMIT 6.046J Design and Analysis of Algorithms, Spring 2015Lecture 13: Incremental Improvement: Max Flow, Min Cut
Lecture 13: Incremental Improvement: Max Flow, Min Cut
1:22:58
Description: In this lecture, Professor Devadas introduces network flow, and the Max Flow, Min Cut algorithm.
Instructors: Srinivas Devadas
