Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
CS 7510 - Graph Algorithm |
Algorithms for graph problems such as maximum flow, matching, network reliability, minimum cuts, covering, coloring, planarity, shortest paths, and connectivity. Crosslisted with MATH 7510 and ISYE 7510.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP Dept/Computer Science Department Course Attributes: Theory (CS) Restrictions: May not be enrolled in one of the following Levels: Undergraduate Semester Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * Prerequisites: Graduate Semester level CS 6505 Minimum Grade of D or Graduate Semester level CS 6550 Minimum Grade of D |
Return to Previous | New Search |