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

Notes for Lecture 13 (PDF) are available.
Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Lecture Notes
Instructor Insights