INDE 511

GRAPH ALGORITHMS

Credit Hours: 3 · Graduate

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: CMOR 446 . Recommended Prerequisite(s): INDE 545 or CAAM 378 Mutually Exclusive: Cannot register for INDE 511 if student has credit for CMOR 446 .

Prerequisites & course information

Short Title: GRAPH ALGORITHMS Department: Industrial Engineering Grade Mode: Standard Letter Course Type: Lecture Credit Hours: 3 Restrictions: Enrollment is limited to Graduate level students. Course Level: Graduate

Sources

Course catalogue ↗2026–2027