Lec 30 | MIT 18.085 Computational Science and Engineering I

From the creator

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

Published 2008-05-19 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.