Combinatorial and Graph Algorithms
Overview
Subject area
CMP
Catalog Number
775
Course Title
Combinatorial and Graph Algorithms
Department(s)
Description
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.
Typically Offered
Fall, Spring
Academic Career
Graduate
Liberal Arts
Yes
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4