This is an old revision of the document!

Chapter 7: Network Flow

7.1: The Maximum-Flow Problem and the Ford-Fulkerson Algorithm

7.2: Maximum Flows and Minimum Cuts in a Network

7.5: A First Application: The Bipartite Matching Problem

7.7: Extensions to the Maximum-Flow Problem