Lecture 30: Network flows and combinatorics: max flow = min cut

author: Gilbert Strang, Department of Mathematics, Center for Future Civic Media, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Nov. 24, 2008,   recorded: May 2001,   views: 12599
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)

See Also:

Download Video - generic video source Download mit18085f07_strang_lec30_01.m4v (Video - generic video source 175.2 MB)

Download Video - generic video source Download mit18085f07_strang_lec30_01.rm (Video - generic video source 122.5 MB)

Download Video Download mit18085f07_strang_lec30_01.flv (Video 245.5 MB)

Download Video Download mit18085f07_strang_lec30_01_320x240_h264.mp4 (Video 224.5 MB)

Download Video Download mit18085f07_strang_lec30_01.wmv (Video 520.8 MB)

Help icon Streaming Video Help

Related Open Educational Resources

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: