Next: Ford-Fulkerson algorithm for
Up: Graphs and Combinatorial
Previous: Application of Prim's
- Define network, capacity, source, target, sink, forward/backward edgs, etc.
- Flow augmenting paths. --- give a definition ---
- Cut sets.
- Definition.
- Theorem (net flow in cut sets).
- Theorem (upper bound for flows).
- Main Theorem (augmenting path for flows).
- Theorem (max-flow min-cut theorem).
HPF demo web account
Mon Nov 18 19:45:42 EST 1996