GRAPH ALGORITHMS
Graph Algorithms in Operations Research. Topics include: spanning trees, graph search algorithms, shortest path problems, worst case time complexity analysis, computational complexity, dominating set problems, vertex and edge cover problems, python implementations, and other problems in graph optimization. Instructor Permission Required. Graduate/Undergraduate Equivalency: INDE 511 . Recommended Prerequisite(s): CMOR 360 and COMP 182 Mutually Exclusive: Cannot register for CMOR 446 if student has credit for INDE 511 .
Prerequisites & course information
Short Title: GRAPH ALGORITHMS Department: Comp Appl Math Operations Rsch Grade Mode: Standard Letter Course Type: Lecture Credit Hours: 3 Restrictions: Enrollment is limited to Undergraduate, Undergraduate Professional or Visiting Undergraduate level students. Course Level: Undergraduate Upper-Level
Sources
- Course catalogue ↗2026–2027