6.046J | Spring 2015 | Undergraduate
Design and Analysis of Algorithms
Lecture Videos

Lecture 13: Incremental Improvement: Max Flow, Min Cut

Description: In this lecture, Professor Devadas introduces network flow, and the Max Flow, Min Cut algorithm.

Instructors: Srinivas Devadas

Transcript
Lecture Notes
Notes for Lecture 13 (PDF) are available.
Learning Resource Types
theaters Lecture Videos
theaters Recitation Videos
assignment_turned_in Problem Sets with Solutions
grading Exams with Solutions
notes Lecture Notes
co_present Instructor Insights