You are on page 1of 1

Sean Li CS 4820 Notes − Spring 2013 Introduction to Algorithms Lecture 17 − 2/27/13 Max-flow Min-cut Theorem (cont’d).

Ford-Fulkerson Algorithm. Has complexity O(mc), where C = minA,B {c(A, B)}. Works with rational capacities as well. However, it does not necessarily halt with √irrational capacities: Consider 3 paths with 1, ϕ−1 , ϕ−2 , where ϕ is the golden ratio 1+2 5 . Write r = ϕ−1 . Then r2 = 1 − r, and rk+2 = rk − rk−1 in general. We can obtain paths that go to 0 but do not reach 0 in finite time. Scaling Algorithm. Take ∆ to be the highest power of 2 less than or equal to the min capacity. Compute augmenting paths, and repeat with ∆ := ∆/2. Complexity is O(m log C). Lemma. Each scaling phase takes at most 2m augmentations and takes O(m2 ) time.