graph-theory
The max-flow min-cut theorem
taught
Taught in
-
The max-flow min-cut theorem
Graph Theory
-
Max flow and min cut, revisited
Optimization
Requires
- flow-networks required
- mengers-theorem required
Required by
- Bipartite matching as a flow problem required
- Network flow as a linear program required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.