Princeton University Computer Science Department |
Computer Science 528
Data Structures and Graph Algorithms Fall 2006 |
| COURSE INFORMATION | LECTURES | ASSIGNMENTS | |
|
COURSE INFORMATION
Description: This course will be an advanced examination of topics in data structures and graph algorithms, including open problems and promising research directions. COS 423 or the equivalent is a recommended prerequisite. Possible topics include the union-find problem and variants, dynamic trees, search trees, composite search trees, heaps, network optimization problems including shortest path and maximum flow problems, and various graph algorithms. Lectures: MW 11:00-12:20, Room: 301 ADMINISTRATIVE INFORMATION Instructor: Robert Tarjan Office: 324 CS Building Email: ret AT cs ... Graduate Coordinator: Melissa Lawson Office: 310 CS Building Email: mml AT cs ... Secretary: Mitra Kelly Office: 323 CS Building Email: mkelly AT cs... USEFUL LINKS Previous semester(s): Fall 2005 Classes taught at other institutions: Advanced Data Structures, MIT Spring 2005, Professor Erik Demaine Advanced Data Structures, CMU Fall 2005, Professor Danny Sleater |
|