Network Flows - I

Getting Started with Competitive Programming

(an NPTEL course)

Week 8. Network Flows - I

In this week, we introduce the maxflow problem, study the approach of Ford-Fulkerson and Edmonds-Karp, and round off by modelling a couple of problems as flow networks - specifically, maximum matching and IPL elimination.

Class Plan & Materials

A. Prerequisites
1. Introduction to Network Flow
2. Maximum Matchings via MaxFlow
3. IPL Elimination
Z. Extras