Graph Theory and AlgorithmsOffered this year and most years
Graphs (a.k.a. networks) are ubiquitous in computer science. Moreover, algorithmic problems on graphs have played a singular role in the development of theoretical computer science, e.g. the notions of polynomial time and of linear time and of NP-completeness. This course focuses on those aspects of graph theory that are most relevant to algorithms, on the classical algorithmic developments that have shaped the field, and on some emerging algorithmic methods that show promise of theoretical or practical impact.
|Meeting Time:||MW 3pm-4:20pm|