"Lec 30 - MIT 18.085 Computational Science and Engineering I" Network flows and combinatorics: max flow = min cut A more recent version of this course is available at: http://ocw.mit.edu/18-085f08 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
Video is embedded from external source so download is not available.
Duration: 76m 30s
No content is added to this lecture.
This video is a part of a lecture series from of MIT