Applied and Algorithmic Graph Theory

This course is designed to emphasize the close tie between the theoretical and algorithmic aspects. The topics may include basic concepts such as connectivity, trees, planarity, coloring of graphs, matchings, and networks. It also covers many algorithms such as Max- flow Min-cut algorithm, maximum matching algorithm, and optimization algorithms for facility location problems in networks.