COS 528, Fall 2006: lectures

LECTURES

The schedule is tentative and may change throughout the semester

DATE	LECTURE	READING
09/18/06	Disjoint Set Union	Disjoint Set Union handout class notes
09/20/06	Path Compression Analysis and Amortized Complexity	class notes
09/25/06	Top Down Path Compression Analysis	Union Find slides
09/27/06	Top Down Analysis continued Segmented Path Compression	class notes
10/02/06	Segmented Path Compression continued Maximum Flow	A New Approach to the Maximum Flow Problem class notes
10/04/06	Maximum Flow continued Preflow Push Method	.
10/09/06	NO CLASS	.
10/11/06	Goldberg-Rao Max Flow	class notes
10/16/06	Goldberg-Rao Max Flow continued Arc Balancing Algorithm	.
10/18/06	Excess Balancing Algorithm	Self-Adjusting Binary Search Trees class notes
10/23/06	NO CLASS	.
10/25/06	Excess Balancing Algorithm cont Splay Trees	.
10/30/06	FALL BREAK	.
11/01/06	FALL BREAK	.
11/06/06	CLASS STARTS AT 10:15 Dynamic Trees	.
11/08/06	NO CLASS	.
11/13/06	NO CLASS	.
11/13/06	CLASS STARTS AT 11 Dynamic Trees Cont.	.
11/15/06	Shortest Paths talk by Renato	.
11/20/06	Shortest Path and Minimum Cost	shortest paths scaling algorithms
11/22/06	Shortest Path and Minimum Cost	.
11/27/06	Shortest Path and Minimum Cost	.
11/29/06	Mergeable Trees	.
12/04/06	mergeable trees without cuts or the parent function via ordinary dynamic trees	extreme elevation on a 2 manifold
12/06/06	Planar Graphs Seperator Theorem	Applications of a Planar Separator Theorem A Sepearator Theorem for Planar Graphs