George Mason University
DEPARTMENT OF COMPUTER SCIENCE
CS684 - Graph Algorithms - Fall 2003
Monday 4:30-7:10, Robinson B202
Prerequisites |
Description |
Readings |
Syllabus |
Grading |
Late |
Dates
This page last updated on 8/18/03.
Professor Dana Richards
703-993-1545
richards@cs.gmu.edu
Course office hours: MOnday and Tuesday 11:00-12:00 or by appt.
Sci&Tech II Room 425
PREREQUISITES :
Algorithms and elementary data structures.
DESCRIPTION :
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.
READINGS:
- Data Structures and Network Design, R. E. Tarjan.
- Selected papers.
SYLLABUS:
We will follow the text closely.
First part of the semester will be lecture material on the readings.
The remainder will be for class presentations.
GRADING :
There will be two tests.
A class presentation will be given on a recent relevant paper.
LATENESS:
Projects will be marked down 25% each week they are late.
Back to the top.