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.

Course Info

Departments
As Taught In
Spring 2015
Level
Undergraduate
Topics
Learning Resource Types
Lecture Videos
Problem-solving Videos
Problem Sets with Solutions
Exams with Solutions
Lecture Notes
Instructor Insights
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2025 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2025 Massachusetts Institute of Technology