| |
Mar 17, 2026
|
|
|
|
|
MAT 570 - Graphs and Network Flows (4) Matching theory in graphs and network flows in capacity-constrained networks. Major topics include the Konig-Egervary Theorem for bipartite graphs and the Maximal Flow Algorithm for networks, along with a wide variety of applications.
Prerequisite(s): MAT 370 or consent of the instructor. Component(s): 4 lectures/problem-solving. When Offered: Sp, even yrs
Add to Portfolio (opens a new window)
|
|