13. Incremental Improvement: Max Flow, Min Cut
152.3 هزار بار بازدید -
9 سال پیش
-
MIT 6.046J Design and Analysis
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
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
9 سال پیش
در تاریخ 1394/12/14 منتشر شده
است.
152,343
بـار بازدید شده