Computer Science 163/265, Winter 2013:
Graph Algorithms

General Course Information

Coursework will consist of weekly homeworks, a midterm, and a comprehensive final exam. Group work on homeworks is permitted; each student should turn in his or her own copy of the homeworks. The undergraduate (163) and graduate (265) courses will share lectures, and some homework problems; however, the graduate course will have additional homework problems and different exams.

The text we will be using is Graph Algorithms, a collection of readings compiled from Wikipedia.

The course meets Monday, Wednesday, and Fridays, 11:00 - 11:50 in ICS 174. Prof. Eppstein's office hours are Tuesdays 1:00 - 3:00 (or by appointment) in Bren 4214. The T.A. is Michael Bannister; his office hours are Wednesdays 1:00 - 3:00 (Bren 4013) and Thursdays 10:00 - 12:00 (Bren 3011). Homeworks will be returned during T.A. office hours. We also have Mehdi Sadri as a reader.

The final grade will be formed by combining the numerical scores from the homeworks (20%), midterm (35%), and final (45%).

Tentative Schedule of Topics

Material from Previous Course Offerings