Title: MATH 662 Graph Algorithms
Prerequisites: MATH 613 or equivalent are suggested.
Course Description: Graphs are used to model problems in different areas in mathematics and engineering, such as in metric geometry, network theory, and VSLI design.
This course will address algorithmic problems about graphs, such as how to efficiently determine whether the input graph has certain properties or efficiently find
certain substructures in the input graph. We will cover classical results and recent developments. Tentative topics include but are not limited to: flows, matchings,
Gorory-Hu trees, Steiner trees, fixed-parameter tractability, and property testing.
Average time dedicated per week (estimate): 3-5 hours