ISE-6404: Graph Theory and Network Flows
Description: Graph theoretic concepts and definitions, optimization problems over graphs, and basic results; minimum cost network flow problems (including assignment, transportation, max flow, and shortest-path problems) and associated algorithms with implementation strategies; PERT and CPM; and network design and synthesis problems.
Pathways: N/A
Course Hours: 3 credits
Corequisites: N/A
Crosslist: N/A
Repeatability: N/A
Sections Taught: 8
Average GPA: 3.87 (A)
Strict A Rate (No A-) : 82.32%
Average Withdrawal Rate: 0.00%
| Douglas R Bish | 2019 | 100.0% | 0.0% | 0.0% | 0.0% | 0.0% | 0.0% | 4.00 | 3 |
| Staff Beling | 2023 | 55.5% | 44.4% | 0.0% | 0.0% | 0.0% | 0.0% | 3.66 | 1 |
| Hanif D Sherali | 2008 | 80.8% | 19.1% | 0.0% | 0.0% | 0.0% | 0.0% | 3.78 | 2 |
| Barbara M Fraticelli | 2013 | 90.7% | 9.4% | 0.0% | 0.0% | 0.0% | 0.0% | 3.87 | 2 |