Algorithms for graph problems such as maximum flow, covering, matching, coloring, planarity, minimum cuts, shortest paths, and connectivity. Crosslisted with MATH 7510 and CS 7510.
Requisites
Prerequisites:
CS 6505 (Min. Grade: D) or CS 6550 (Min. Grade: D)
Restrictions:
Cannot be enrolled in one of the following Levels: Undergraduate Semester (US)
Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * (A)
All Instructors
This total includes data from semesters with unknown instructors
Yang Peng
Fall 2019
Website Lead
Buzz Grades is maintained by Donghyun "Vince" Kim · Data: LITE (2016-2025), Course Catalog & OSCAR
Copyright
2025 Donghyun Kim, Buzz Grades
·