cs 4433 - algorithmic graph theory (3) f odd

the elements of the theory of graphs and directed graphs with motivating examples from communication networks, data structures, etc., shortest paths, depth first search, matching algorithms, parallel algorithms, minimum spanning trees, basic complexity theory, planarity, and other topics. programming assignments are included.

prerequisite: cs 3633 with a grade of “c” or higher.