Lecture 3 hours; 3 credits.
Prerequisite CS 600.
Investigate a variety of
graph algorithms, both sequential and parallel, known to have
applications to such areas
as scheduling, robotics, computational geometry,
VLSI design, and pattern recognition.
The students will learn graph algorithms both sequential and
parallel in a hybrid enviornment: the course contains formal
lectures along with team-projects.