Maximum flow-minimum cut and assignment problems with the Hungarian algorithm

What this note covers

1. Flow networks: the rules that govern them
2. Finding the maximum flow by inspection
3. Cuts and the capacity of a cut
4. The maximum flow-minimum cut theorem
5. Assignment problems and the bipartite representation
6. The Hungarian algorithm, step by step
7. Maximisation, unequal sets and other variations
8. How this is examined, and what separates a top answer

8 sections · 12 key terms & formulas · 6 common mistakes