Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
courses:cs211:winter2012:journals:paul:home [2012/04/04 17:35] – [Chapter 7] nguyenp | courses:cs211:winter2012:journals:paul:home [2012/04/06 01:20] – [Chapter 7] nguyenp | ||
---|---|---|---|
Line 756: | Line 756: | ||
* Section 7.2 - Maximum Flows and Minimmum Cuts in a Network | * Section 7.2 - Maximum Flows and Minimmum Cuts in a Network | ||
* Cut: s-t cut is a partition (A,B) where s is in A and t is in B | * Cut: s-t cut is a partition (A,B) where s is in A and t is in B | ||
+ | * Problem: Find an s-t cut of minimum capacity | ||
+ | * The capacity of a cut is the sum of all the possible stuff that can go through the edge at once | ||
+ | * Flow Value Lemma: Let f be any flow, and let (A, B) be any s-t cut. Then, the value of the flow is = f_out(A) – f_in(A). | ||
+ | * Weak Duality: let f be any flow and let (A, B) be any s-t cut. Then the value of the flow is at most the cut’s capacity. | ||
+ | * Corollary: Let f be any flow, and let (A, B) be any cut. If v(f) = cap(A, B), then f is a max flow and (A, B) is a min cut | ||
+ | * Augmenting path theorem: Flow f is a max flow iff there are no augmenting paths | ||
+ | * Max-flow min-cut theorem: The value of the max flow is equal to the value of the min cut. | ||
* | * |