Feb 18, 2019  
2018-2019 Undergraduate Catalog 
    
2018-2019 Undergraduate 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: Graduate standing in Applied Mathematics or permission of the instructor. Note: This course assumes that students have the equivalent of an undergraduate-level course in graph theory (e.g., MATH 4408). Max hours: 3 Credits. Semester Hours: 3 to 3



[Add to Favorites]