A New Balancing Method for Solving Parametric Maximum Flow

Computer Systems Colloquium (Winter 2007)

A New Balancing Method for Solving Parametric Maximum Flow Problems (March 14, 2007)

Listen now

Description

A new, simple and fast algorithm finds a sequence of nested minimum cuts of a bipartite parametric flow network. The talk models how this new method can solve a number of interesting real-world problems.

More Episodes

Building Your Own Dynamic Language is Fun and Easy! First Steps on the Road to Reinventing Computing (February 14, 2007)

Viewpoints Research Insitute recently began a five-year project to reinvent programming and interaction with computers.

Published 04/10/07

Computer Architecture is Back: The Berkeley View of the Parallel Computing Research Landscape

Now that the IT industry is urgently facing perhaps its greatest challenge in 50 years, and computer architecture is a necessary but not sufficient component to any solution, this talk declares that computer architecture is interesting once again.

Published 04/10/07