Mar 17, 2026  
2012-2013 University Catalog (Revised 2012-10-02) 
    
2012-2013 University Catalog (Revised 2012-10-02) [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

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)