graph-theory
Bipartite matching as a flow problem
taught
Taught in
-
Bipartite matching as a flow problem
Graph Theory
-
Matching and flow in practice
Graph Theory
Requires
- max-flow-min-cut required
- halls-marriage-theorem required
Required by
Nothing in the catalog needs this yet.
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.