# Flows

algonotes

lecturenotes

This week, we will learn about:

- The problem of finding a maximum flow in a network,
- the relationship between a maximum flow and a minimum cut,
- a pseudo-polynomial-time algorithm for finding a maximum flow [Ford-Fulkerson],
- a method to decompose a flow into a combination of path and cycle flows.

We will also apply the maxflow algorithm to solve the following problems:

- Tuple Selection
- Exam Scheduling
- IPL Elimination

Detailed notes are coming soon (will be up by 5PM on 26 Jun).