Lecture 30 - Network flows and combinatorics: max flow = min cut, Computational Science and Engineering I - ACADEMIC EARTH

	Filter videos that may contain explicit content
	Watch videos on the host site for those that don't play in Truveo

Home | TV Shows | Most Twittered

> > > Lecture 30 - Network flows and combinatorics: max flow = min cut, Computational...

View video on ACADEMIC EARTH

This video is provided and hosted from a third party server. Please be aware that this is search functionality helping you discover publicly available websites and their content. Truveo as a search engine does not host and is not responsible for the content.

Description: This course provides a review of linear algebra, including applications to networks, structures, and estimation, Lagrange multipliers. Also covered are: differential equations of equilibrium;... (more)

Date: Tue, 03 Nov 2009

Tags: Gilbert Strang, MIT, Mathematics, Computational Science and Engineering I

Email a Friend

Clear
Send

Share this video

Facebook	Twitter
StumbleUpon	MySpace

Embed:

URL:

	Help	Company Info	Contact	Press	Jobs	Terms of Use	Privacy Policy	FAQ	Developer Resources	Video Publishers
Truveo video search lets you search and find videos from across the Web. Use Truveo to find all types of online video including hit television shows, full-length movies, breaking news clips, sports highlights, music videos, or the latest viral videos. If you are looking for a specific video, Truveo video search can help you find exactly the video you want. Truveo can also help you browse through video across the web and discover new videos that you might like. ©2004-2009 Truveo, Inc. All Rights Reserved