CS 420/520: Graph theory with applications to computer science (Winter 18)

Instructor: Amir Nayyeri (Office hours: Tue 3:30pm-4:30pm at KEC 3061)

Lectures: Tue, Thr 2:00pm-3:20pm in WNGR 116


Course description: The course covers efficient (exact or approximation) algorithms for fundamental graph optimization problems such as minimum spanning trees, shortest paths, maximum matching, planar separators, Steiner trees and traveling salesmans problem.

Evaluation: Homework (60%), Midterm (40%)

Prerequisites: (CS 325 or CS 325H) and MTH 232


Homework Assignments:


Lectures:

  1. Tue 1/9: Introduction, graph representation and traversal.
    References: (1) Basic graph algorithms, Jeff Erickson.

  2. Thr 1/11: Introduction, graph representation and traversal.
    References: (1) Basic graph algorithms, Jeff Erickson.

  3. Tue 1/16: Problem Solving Session, try problems in HW1 before the class.

  4. Thr 1/18: No Class.