MATH 5432 - Computational Graph Theory

Summer 2010 Registration MATH 5432
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. Prereq: a course in graph theory and some programming experience.Semester Hours: 3to 3
Registration is changing. Visit our website for details ucdenver.edu/registration.