IEOR 8100 Graph Theory

Class Tue, Thu 11:40am-12:55pm

327 Mudd

office hours Thu, 10:30-11:30 308 Mudd

Course description

This course will be a survey of various width parameters in graph theory, such as path-width, tree-width, rank-width, clique-width etc. The focus will be on sufficient conditions for a class of graphs to have bounded width (under the different definitions), and on algorithmic implications of bounded width. We will also discuss similar concepts for tournaments (these are orientations of complete graphs, and over the last few years substantial progress has been made in that area).

Grade determined by homework assignments