This course presents design and analysis of graph algorithms, and applications of these algorithms for solving real world problems. This course covers different graph classes, the design and analysis of graph algorithms, distance and connectivity, finding maximum matchings, graph colorings, vertex covers, maximum cuts, matrices, graph searching, planar graphs, digraph and networks, tree codes, NP-complete problems, and graph approximation algorithms. The students are required to complete problem solving and programming assignments.
Prerequisites
CS 600 or its equivalent