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.
In this course, Stanford University gives 27 video lectures on the Computer Systems Laboratory Colloquium. This course features weekly speakers on current research and developments in computer systems. Topics touch upon all aspects of computer science and engineering including logic design, computer organization and architecture, software engineering, computer applications, public policy, and the social, business, and financial implications of technology. Frequently the Colloquium provides the first public forum for discussion of new products, discoveries, or ideas. This playlist consists of seminar speakers recorded during the 2006-2007 academic year.
The original name of this course is: Computer Systems Laboratory Colloquium (2006-2007).