Max Flow, Min Cut & Matching

Residual graphs, max-flow min-cut, Edmonds-Karp and Dinic, bipartite matching, and modeling problems as flow.

0 / 2 solved

Question Tags Difficulty Success

1. A Cut As Receipt

max-flowmin-cut +2

Medium —

2. Splitting Every Hall

max-flowvertex-capacity +2

Hard —

Learning Resources

cp-algorithms, Maximum flow, Edmonds-Karp

cp-algorithms, Kuhn's algorithm for maximum bipartite matching

Jeff Erickson, Maximum Flows and Minimum Cuts chapter

Jeff Erickson, Applications of Flows and Cuts chapter

Up next

2 of 2 questions here are still unsolved.

Next in Strings String Representation & Cost Models