CS267 -- Graph Algorithms -- Fall 2016

Instructor: Virginia Vassilevska Williams
TA: Nicole Wein, nwein@stanford.edu

Time: Tuesdays and Thursdays 1:30pm--2:50pm, Hewlett 102 (NEW ROOM!)
Office Hours:
Nicole: Tuesdays 4:30-6 at Gates 498
Virginia: by appointment/email
Piazza: search for cs267


This course is an introduction to advanced topics in graph algorithms. Focusing on a variety of graph problems, we will explore topics such as small space graph data structures, approximation algorithms, dynamic algorithms, and algorithms for special graph classes.

Workload for this course:

Prerequisites: This is an advanced course, meant for upper-level undergraduates and beginning graduate students, but it is open to anyone. Good familiarity with algorithmic concepts is necessary. We will try to recall the concepts needed along the way. However, having taken a course in algorithms such as CS161 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, and we will have lecture notes.

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