COMP 560
Graph Algorithms and Applications

Fall 2006-07
TuTh 2:35-3:55
688 Sherbrooke St. West (SH688 is a highrise building near the corner of Sherbrooke and University St.), room 455
Prof. Whitesides


Graphs provide essential models for many applications areas of computer science, and at the same time, they are fascinating objects of study in pure mathematics. There have been a number of exciting recent developments in graph theory that are important for designers of algorithms to know about. Correspondingly, the algorithmic viewpoint of computer science has stimulated much research in graph theory. Graph theory and graph algorithms are inseparably intertwined subjects.

The purpose of this course is to cover aspects of modern graph theory essential for those who anticipate either using graph models or doing research on graphs or graph algorithms in their advanced studies.

Both computer science and mathematics students are welcomed, as well as engineering students with permission of the instructor. For CS undergraduate students, a background of COMP 360 or equivalent is essential. For CS graduate students, the usual undergraduate courses in algorithms should suffice as background. For Math students, experience with doing proofs should suffice. No programming is required, and the highlights of the graph algorithms part of COMP 360 will be reviewed. The essential prerequisites are curiosity, some experience with doing proofs, and a love of problem solving.

The following information will give an idea about the course.