|
Computer Science 528
Data Structures and Graph Algorithms
Robert Tarjan |
Fall 1997 |
Directory
Schedule and Readings |
Assignments |
Links |
What's New?
Data structures and algorithms for graph and network problems, including
disjoint set union, heaps, search trees, search on graphs, minimum spanning
trees, shortest paths, network flows, and matchings. The intent of the
course is to examine the most efficient algorithms known for a variety of
combinatorial problems and to discover the principles underlying the design
and analysis of these algorithms. The emphasis will be on asymptotic
worst-case and amortized analysis.
Prerequisite: COS 423 or equivalent.
General Information
Lectures:
- TTh 3:00--4:20 am, room 302 CS building
- MF 12--1:30 pm, room 302 CS building, as arranged
Professor: Robert Tarjan,
324 CS Building, 258-4797, ret@cs
Office Hours: by arrangement on Monday and Friday afternoons.
Lecturer: Andrew
V. Goldberg , NEC Research Institute,
phone: (609) 951-2727,
FAX: (609) 951-2488, avg@research.nj.nec.com