CS367 -- Algebraic Graph Algorithms -- Fall 2015

Instructor: Virginia Vassilevska Williams
TA: Anthony Kim
Time: Fridays 12:30pm--3:20pm, Building 460, Room 334
Office Hours: By appointment/email


This graduate course will explore topics around matrix multiplication and its use in the design of graph algorithms. We will focus on problems such as transitive closure, shortest paths, graph matching, and many other classical graph problems.

Workload for this course:

Prerequisites: This is an advanced course, meant for graduate students, but it is open to anyone. Good familiarity with algorithmic concepts and good mathematical maturity is necessary. We will try to recall the concepts needed along the way. Having taken courses in algorithms such as CS161 and CS261 is particularly useful, otherwise it may be tough to follow the material. There is no textbook for the course, but we will catalogue some reading material found on the web as we go.

Announcements: Upcoming topics (the rough plan: subject to change!)