Study Guide 
Tucker: Applied Combinatorics 
§4.3 Network Flows
Dr. Lee Eimers

Introduction:  In this section, we seek to maximize a "flow" from vertex a to vertex z such that the flow in each edge does not exceed that edge's capacity.  This is the basis for solving transport problems in a variety of applications..

Concepts and Vocabulary:
The following boldfaced (or italic) terms and phrases introduced in this section.
a-z Cut
Capacity of a cut
Capacity of an edge
Chain

 Ford-Fulkerson-
Augmenting-Flow Algorithm
Flow
Maximal a-z Flow
Minimal Capacity a-z Cut		 Sink
Slack
Source
Value of  a flow
Points of Interest:

1.   One important theorem is that that there is always a minimal capacity a-z cut where the sum of the capacities is equal to the maximal a-z flow.

2. Know how to apply the Ford-Fulkerson Augmenting Flow Algorithm to directed networks to find the maximal a-z flow and the minimal capacity a-z cut.

Homework Assignment:
#2, 3, 8 , 31
 Thought for the Day
  Finally, brethren, whatsoever things are true, whatsoever things are honest, whatsoever things are just, whatsoever things are pure, whatsoever things are lovely, whatsoever things are of good report; if there be any virtue, and if there be any praise, think on these things.  (Paul in Phillipians 4:8)