Aug 16, 2018  
2014-2015 Undergraduate Catalog 
    
2014-2015 Undergraduate Catalog [ARCHIVED CATALOG]

[Add to Favorites]

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. Max hours: 3 Credits. Semester Hours: 3 to 3



[Add to Favorites]