Prerequisites: CS 111; graduate standing
Description: Addresses the solving of combinatorial problems by studying their morphisms (transformations preserving the problem). Covers optimum path problems and their variants. Develops general techniques and the ability to work through the solutions of challenging special cases. Focuses on utilizing symmetry to systematically reduce a problem.