Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Infrequent. Algorithmic techniques in graph theory and other discrete mathematics areas. Typical topics include: branch-bound algorithms, matching, colorings, domination, min-plus algebra, simulated annealing and related heuristics, NP-completeness theory. Note: This course assumes that students have the equivalent of an undergraduate-level course in graph theory (e.g., MATH 4408).
Units: 3.0
Hours: 3 to 3