This class is intended for Computer Science, Electrical Engineering, Mathematics, Statistics
and other graduate students with an interest in or a need for graph algorithms.
Requisite supporting theory will also be covered, so that there is no need for
previous study beyond an introduction to discrete mathematics.
It is listed as CS594, Section 003.
Enrollment is by permission of the instructor only.
Three hours credit will be given.
Students will be expected to do a good deal of reading and homework.
Accordingly, class time will largely be devoted to guided discussions, with formal
lectures kept to a minimum.
Undergraduate students may also inquire about this course, in which
case it is listed as CS494, Section Number 003.
Stepping Stones
(1) Review graph theoretical topics as needed.
(2) Study graph algorithms and their place in modern computing.
(3) Perform algorithm synthesis, realization and implementation across a variety of platforms.
(4) Learn about prominent open problems and explore new research horizons of interest.
Required Text
Graph Theory
Diestel, Springer, ISBN 3-540-26183-4
Supplemental Texts
Introduction to Graph Theory
West, Prentice-Hall, ISBN 0-13-227828-6
Extremal Graph Theory
Bollobás, Academic Press, ISBN 0-12-111750-2
Handbook of Combinatorics
Graham, Grötschel and Lovasz, MIT Press, ISBN 0-262-97170-3
