The page uses Browser Access Keys to help with keyboard navigation. Click to learn moreSkip to Navigation

Different browsers use different keystrokes to activate accesskey shortcuts. Please reference the following list to use access keys on your system.

Alt and the accesskey, for Internet Explorer on Windows
Shift and Alt and the accesskey, for Firefox on Windows
Shift and Esc and the accesskey, for Windows or Mac
Ctrl and the accesskey, for the following browsers on a Mac: Internet Explorer 5.2, Safari 1.2, Firefox, Mozilla, Netscape 6+.

We use the following access keys on our gateway

n Skip to Navigation
k Accesskeys description
h Help
    University of Colorado Denver
   
 
  Nov 24, 2017
 
 
    
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]