CS 594, Special Topics in Computer Science
Spring Term, 2002

Instructor Michael A. Langston

Special Topic is Extremal Graph Theory

Time and Place

Mondays and Wednesdays, from 2:10 to 3:25pm
Initially set for Rm 206, Claxton Building, but likely to move to a much smaller room


This class is intended for CS, ECE and Mathematics graduate students with interests in advanced graph theory, graph algorithms and applications. It is listed as CS594, Section Number 29664. 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 other work outside class. Accordingly, formal lectures will be kept to a minimum. Class time will largely be spent instead in guided discussions, based on timely research topics and student interests. Undergraduate students may also inquire about this course, in which case it is listed as CS494, Section Number 29339.

Major Goals

(1) Review the basics of graph theory and graph algorithms.
(2) Investigate the relevance of extremal graph theory to the study of modern computing.
(3) Learn about prominent open problems and explore new research horizons of interest.

Required Text

Introduction to Graph Theory
West, Prentice-Hall, ISBN 0-13-227828-6

Supplemental Texts

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

Computers and Intractability
Garey and Johnson, Freeman, ISBN 0-7167-1045-5