CMP 775: Combinatorial and Graph Algorithms.
4 hours, 4 credits. A study of some elementary and advanced combinatorial and graph algorithms, including dynamic programming, greedy methods, spanning and transversing graphs, shortest paths, maximum flow, matching and convex hulls. PREREQ: Course in data structures.
Last modified: 9/6/2013