Lecture 28

Learning objectives

After this class, you should be able to:

1. Given a network flow, apply the Edmonds-Karp algorithm to find a max-flow.
2. Prove that the time complexity of the Edmonds-Karp algorithm is O(VE²).

Reading assignment

1. CLR: Section 26.2, material after the max-flow min-cut theorem.
2. None -- prepare for final exam!

Exercises and review questions

• Questions on current lecture's material
  1. CLR: Exercise 26.2-2. (You may discuss the solution on the disucssion board.)
  2. CLR: Exercise 26.2-10. (You may discuss the solution on the disucssion board.)
• Questions on next lecture's material
  1. None.