30211
VIDEOS
1582
EVENTS
20528
AUTHORS
Sign up
Sign in
VIDEOS
EVENTS
RESEARCH PROJECTS
ORGANIZATIONS
AUTHORS
HOME
MIT 18.085 Computational Science and Engineering I - Fall 2007
Lecture 30: Network flows and combinatorics: max flow = min cut
Lecture 30: Network flows and combinatorics: max flow = min cut
Gilbert Strang
Published on 2008-11-24
12650 Views
MIT 18.085 Computational Science and Engineering I - Fall 2007
Pause
Mute
Subtitles
en-de
en-es
en-fr
en-sl
en
en-zh
Off
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen
Bookmark
You need to login
Share
Embed
MORE VIDEOS FROM THE EVENT
MORE VIDEOS FROM THE SAME CATEGORIES
Except where otherwise noted, content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 International license.
