This is an old revision of the document!


Chapter 7

Many problems can evolve from the Bipartite Matching problem, such as the perfect matching problem, the assigning-job-to-machine problem, and what we focus on this chapter-network flow problem.

Section 1: The Maximum-Flow and the Ford-Fulkerson Algorithm

courses/cs211/winter2011/journals/wendy/chapter7.1301886239.txt.gz · Last modified: 2011/04/04 03:03 by shangw
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0