Review of basic notions of Graph Theory, Flows, Matchings and Vertex Covers: structural properties and algorithms, Vertex and edge colorings, Special graph classes: structural properties, membership testing, faster algorithms for hard problems when input restricted to the classes, Treewidth: separators and dynamic programming, Parameterized Problems and Algorithmic Techniques.
INSTRUCTOR
COURSE DESCRIPTION: