"Lec 19 - A New Balancing Method for Solving Parametric Max Flow" March 14, 2007 lecture by Bin Zhang for the Stanford University Computer Systems Colloquium (EE 380). A new, simple and fast algorithm finds a sequence of nested minimum cuts of a bipartite parametric flow network. Instead of working with the original parametric flow-network, the new method works with a derived non-parametric flow network and finds a particular state of the flows in the derived network. EE 380 | Computer Systems Colloquium: http://www.stanford.edu/class/ee380/ Stanford Computer Systems Laboratory: http://csl.stanford.edu/ Stanford Center for Professional Development: http://scpd.stanford.edu/ Stanford University Channel on YouTube: http://www.youtube.com/stanforduniversity/
Video is embedded from external source so embedding is not available.
Video is embedded from external source so download is not available.
No content is added to this lecture.
This video is a part of a lecture series from of stanford