Description
Hamiltonian and Eulerian properties, matching, trees, connectivity, coloring problems and planarity. Emphasis on algorithms and applications, including optimal network flows.
Prerequisite: MATH 42 and MATH 129A (with a grade of "C-" or better in each) or instructor consent.
Grading
Normal Grade Rules
Units
3
Page last generated: 08/01/2008 12:11:55
print
mail