COS 528: Data Structures and Graph Algorithms
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 is on asymptotic worst-case and amortized analysis.
Semester:
Fall18
Lectures:
Wednesday, 1:30-4:20
Location:
Engineering Quadrangle E311
Faculty
Robert Tarjan
Office:
Computer Science 305
Extension:
4797
Email:
ret
Additional Information
The Graduate Coordinator is Nicki Mahler
Email:
ngotsis
Office:
Computer Science 213
Extension:
5387