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. CLR: Section 26.3, page 664-665.

Exercises and review questions

• Questions on current lecture's material
  1. CLR: Exercise 26.2-2.
  2. CLR: Exercise 26.2-10.
• Questions on next lecture's material
  1. Define a bipartite graph, and draw an example with at least 3 vertices in each partition, with at least one vertex in each partition having degree greater than two.
  2. Find a matching for the graph in figure 22.1 (page 528).