Lecture 30: Network flows and combinatorics: max flow = min cut
recorded by: Massachusetts Institute of Technology, MIT
published: Nov. 24, 2008, recorded: May 2001, views: 12595
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Download mit18085f07_strang_lec30_01.m4v (Video - generic video source 175.2 MB)
Download mit18085f07_strang_lec30_01.rm (Video - generic video source 122.5 MB)
Download mit18085f07_strang_lec30_01.flv (Video 245.5 MB)
Download mit18085f07_strang_lec30_01_320x240_h264.mp4 (Video 224.5 MB)
Download mit18085f07_strang_lec30_01.wmv (Video 520.8 MB)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.