MATH 5432 - Computational Graph Theory

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: 3 to 3