Description:  This is an introductory course in Graph Theory with an emphasis on classical graph algorithms and their applications to problems in connectivity, routing, matching, and graph embeddings.  Topics will include:  representations of graphs, bipartite graphs, Cayley's formula, minimum spanning trees, shortest path algorithms, vertex and edge connectivity, directed graphs, network flows and cuts, Menger's theorems, Eulerian and Hamiltonian graphs, planar graphs, matchings, and colorings.

Time and Place:  TTh   2:00 – 3:45    Jack Baskin Engineering  165
Class Webpage: http://www.cse.ucsc.edu/classes/cmpe177
Class News Group: ucsc.class.cmpe177

Instructor:   Patrick Tantalo  (http://www.cse.ucsc.edu/~ptantalo/)
Email:   ptantalo@cse.ucsc.edu
Office:   Jack Baskin Engineering  309B
Office Hours:   MWF   10:30-12:30, and by appointment.
Phone:   831-459-3898
 
 

General Information

Homework Assignments

Programming Project 

Random Graph: A perl script for creating random input files for the programming project