13. Incremental Improvement: Max Flow, Min Cut

From the creator

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: Srinivas Devadas In this lecture, Professor Devadas introduces network flow, and the Max Flow, Min Cut algorithm. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Published 2016-03-04 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.