Syllabus (Tentative)

Week Topics Reading
1 Introduction, Administration, Algorithms and Complexity, Basic graph algorithms Chapters 1,2,3
2 Minimum Spanning Trees Chapter 13
3 Shortest Paths -- Bellman Ford, Dijkstra, data structures for Dijkstra Chapter 4
4 Shortest Paths -- All pairs, relabeling, scaling, minimum-mean cycle Chapter 5
5 Maximum Flows -- Ford Fulkerson, max flow minimum cut, Edmonds-Karp Chapter 6, 7.1-7.4
6 Maximum Flows -- push/relabel algorithms, generic and FIFO Chapter 7.6-7.9
7 Maximum Flows -- additional topics
8 Minimum Cost Flows -- general algorithms Chapter 9
9 Minimum Cost Flows -- cycle cancelling Chapter 10.5
10 Assignments and Matchings Chapter 12
11 Assignments and Matchings Chapter 12
12 Multicommodity flows Chapter 17
13 Additional topics