Computer Science 160
Graph Theory
Fall 2011 Syllabus
http://www.cs.tufts.edu/comp/150GT


No Class on Wednesday, September 14th (DLS away at NSB meeting)
No Class on Monday, October 10th (Columbus Day)
Proposed Make-Up Class on Tuesday, November 8th at 3pm (a Friday schedule)
No Class on Wednesday, November 23rd (Thanksgiving Holiday Weekend)
FIRST EXAM: TBA
SECOND EXAM: Monday, December 12th at 3pm (last day of classes)
PROJECT PRESENTATIONS: TBA (Possibly during "exam" slot from 3-6pm on Tuesday, December 20. Possibly earlier.)


Handouts:

Announcements, assignments, and handouts will be posted on the class web pages http://www.cs.tufts.edu/comp/150GT/documents . Please check frequently.

Brief Description:

Introduction to graph theory, including trees, matchings, connectivity, colorings, and planar graphs. There is no required programming in this class, but there are applications in computational geometry, computational biology, and algorithms.

Prerequisites:

COMP 160 OR COMP 170 OR any math course numbered 100 or above.

Class Meetings in Anderson 313:

Mondays and Wednesdays, 3:00-4:15 PM


Instructional Staff:

Prof. Diane L. Souvaine (dls@cs.tufts.edu)

Office: Halligan 107A.
Office Hours: TBA

Textbooks:

Douglas West: Introduction to Graph Theory, 2nd edition, Prentice-Hall, 2001. ISBN 0-13-014400-2. [REQUIRED]
http://www.amazon.com/Introduction-Graph-Theory-Douglas-West/dp/0130144002/ref=tmm_hrd_title_0
TBA, [RECOMMENDED]