Computer Science 163, Spring 2012:
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 text we will be using is Graph Algorithms, a collection of readings compiled from Wikipedia.

The course meets Tuesdays and Thursdays, 12:30 - 1:50 in SSL 290. The T.A. is Paweł Pszona (; his office hours are Tuesdays 2:00-4:00 and Wednesdays 12:00-2:00 in Bren Hall room 4219. Homeworks will be returned during T.A. office hours. We also have Cesar Ghali as a reader. Instructor office hours will be Thursdays 2:00-3:00 or by appointment.

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