CS267 -- Graph Algorithms -- Fall 2016
- Instructor: Virginia Vassilevska Williams
- TA: Nicole Wein, firstname.lastname@example.org
- 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:
- Three problem sets, about one and a half weeks apart. (50% of the grade)
- A take-home midterm (25% of the grade)
- In-class presentation on a topic of interest related to the course, or on your own research! (25% of the grade)
- We have some scribed lecture notes from previous years. Your job would be to edit at least one lecture, improving and updating the previous version, and submit the revised LaTeX notes within a week of the lecture. During each lecture I will ask for a volunteer scribe/editor, and I will send the volunteer the old LaTeX source. (worth bonus points: might help if you are in the middle between grades)
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.
Upcoming topics (the rough plan: subject to change!)
- Proposed presentation order is below. If your name has a * next to it, email me your paper choice!
Tuesday Nov 29: Zhengyuan, Vincent, Yuetong, Victor, Jose
Thursday Dec 1: Koki, Kevin, James, Aaron, Declan
Tuesday Dec 6: Jake, Nishith, Barak, Hubert, Alexandros
Thursday Dec 8: Brad, Abhijit, Jimmy, Jordan*, William*
- Notes from Lecture 13: [pdf] (Please email me if you want to help with editing)
- Notes from Lecture 12 [pdf] (Please email me if you want to help with editing)
- Notes from Lecture 11: [pdf] (Please email me if you want to help with editing)
- Notes from Lecture 10: [pdf] (Please email me if you want to help with editing)
- HW3 is out: [pdf] due Nov 13.
- PAPER LIST is out: HERE. Email Virginia with your preference - First Come First Serve.
- Midterm extension: the midterm is now due Nov 3 at 11:59pm. This is due to people getting the midterm in their spam folders...
- Notes from lecture 9: [pdf] (Please email me if you want to help with editing)
- Notes from lecture 8: [pdf] (Please email me if you want to help with editing)
- Notes from lecture 7: [pdf]
- Notes from lecture 6: [pdf] (Please email me if you want to help with editing)
- Notes from lecture 5: [pdf].
- Homework 2 is here: [pdf]
- Notes for lecture 4: [pdf].
- Notes for lecture 3: [pdf].
- Homework 1 is here: [pdf]
- Notes for lecture 2: [pdf]
- Notes for lecture 1: [pdf]
- 9/21: Look here for fun stuff to happen!
- 9/27: Algorithms for subgraph isomorphism: Finding copies of a pattern in a large graph
- 9/29: Approximating the girth
- 10/3: HW1 out (on website)
- 10/4: Computing the girth exactly
- 10/6: Approximating the graph diameter
- 10/11: Hitting Set Arguments, All Pairs Shortest Paths
- 10/13: More APSP; Graph Spanners; HW1 due, HW2 out
- 10/18: Graph Spanners
- 10/20: Distance oracles
- 10/24: HW2 due; 10/25: Take Home Midterm out (by email)
- 10/25: Compact routing
- 10/27: Finish compact routing; Dynamic Algorithms
- 11/1: Take Home Midterm Due (by email); HW3 out
- 11/1: Dynamic Algorithms (Graph Connectivity); Paper List Out: pick a paper first come, first serve
- 11/3: Dynamic Algorithms (Transitive Closure)
- 11/10: HW3 due
- 11/8*: Dynamic Algorithms (Graph Matching)
- 11/10*: Treewidth, Planar graph algorithms
- 11/15, 11/17: Other Fun Graph Topics
- Last two weeks (11/29,12/1,12/6,12/8): presentations