Meeting Time: Monday and Wednesday 3:00 - 4:20 (T hour)
Catalogue Description:
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.
To be eligible to take this course, you must have taken an algorithms course aimed at graduate students or upper-division undergraduates. At Brown University, CSCI 1570 is such a course. If you have taken such a course elsewhere, contact me to request an override through the Course Announcement Bulletin. If possible, please provide a link to information on the course you took.
You should also have studied linear algebra. If you have not, be prepared to study some elementary linear algebra on your own.
The course will require you to work on problem sets (often in
collaboration with other students) and occasionally work on
problems during class (again, often in
collaboration with other students).
Here
is the link to the Google Drive that contains research papers, etc.