CS 185
Winter 2001
Network Flows

Syllabus
Course Information

Reading

The paper on randomized minimum spanning trees can be found here
The Goldberg-Rao maxflow paper can be found here
The Karger-Stein minimum cut paper can be found here
The Kolliopoulos-Stein unsplittable flow paper can be found here

Homework

Homework 1
Homework 2
Homework 3