Data Structures and Graph Algorithms

Advanced topics in data structures and algorithms for graph and network problems. 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. We discuss both sequential and concurrent data structures and algorithms.