CMOR 446 - GRAPH ALGORITHMS
Long Title: GRAPH ALGORITHMS
Department: Comp Appl Math Operations Rsch
Grade Mode: Standard Letter
Language of Instruction: Taught in English
Course Type: Lecture
Credit Hours: 3
Restrictions: Must be enrolled in one of the following Level(s):
Undergraduate Professional
Visiting Undergraduate
Undergraduate
Description: 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.