Algorithms (F2008)

We introduced the idea of a flow network, and the concept of a flow from a source to a sink. We then asked the question: “How can we maximize the flow from source to sink”, and developed the Ford-Fulkerson augmenting-path-based algorithm for this problem. A deep relationship to cuts in a graph proved the optimality of this method.

The material is drawn from Sections 7.1 and 7.2 of the textbook.

This entry was posted on Wednesday, September 24th, 2008 at 2:13 pm and is filed under lectures, news.