Graph Theory · Algebra & Patterning
Network Flows and Matching
The max-flow min-cut theorem is a duality theorem: maximum flow equals minimum cut capacity. Hall’s theorem gives the exact condition for a perfect bipartite matching.
WHAT STUDENTS WILL LEARN
✓Apply max-flow min-cut theorem
✓Apply Ford-Fulkerson algorithm
✓Apply Hall’s marriage theorem
✓Model real problems as flow and matching
COURSE OUTLINE · CLICK A PART FOR RESOURCES