George Mason University
DEPARTMENT OF COMPUTER SCIENCE
CS684 - Graph Algorithms - Spring 2018
Thursday 7:20-10:00, IN 136
Professor Dana Richards
Course office hours: MW 1:30-2:30 or by appt.
Engineering Bldg 5320
Algorithms and elementary data structures.
This is a second course in the design and analysis of efficient algorithms. The emphasis is on algorithms for standard graph problems, such as minimum spanning trees, shortest paths, network flow, and maximum matching. We will also study advanced data structures, which are crucial for the more advanced topics. Randomized algorithms will also be discussed.
We will follow the text closely.
There will be two tests.