MIT data structure and algorithms 2015 - 13. Incremental Improvement: Max Flow, Min Cut

5.0 (2)

26 learners

What you'll learn

This course includes

38.3 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

network flow maximum-flow problem max-flow min-cut algorithm residual network Ford Fulkerson algorithm

Full Transcript

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

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

30-Day Beginner Guitar Challenge for New Players

Master the Guitar in 30 Days: Your Ultimate Beginner Challenge! Unleash your inner guitarist with step-by-step lessons designed to transform you from novice to confident player. Join Your Guitar Academy and kickstart your musical journey today!

⭐ 4.3

36 ratings

7 hours