Final Exam:Tuesday December 4, 12:00 to 3:00 pm, 242 College Eight
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 4:00 – 5:45
College Eight 242
Class Webpage: http://www.soe.ucsc.edu/classes/cmpe177/Fall01/
Class News Group: ucsc.class.cmpe177
Instructor: Patrick Tantalo (http://www.cse.ucsc.edu/~ptantalo/)
Email: ptantalo@soe.ucsc.edu
Office: Jack Baskin Engineering 343A
Office Hours: MWF 11:00-1:00, and by
appointment.
Phone: 831-459-3898
In addition I will hold unofficial office hours on Wednesdays from 3:30 to 5:30 pm exclusively for CE177 students, i.e. there will be no competition from CS10 students. "Unofficial" in this context means that you can be only about 90% certain that I will be there.
Teaching Assistant: Yujiao Ping (yping@cse.ucsc.edu)
Office: Trailer 15 (behind Baskin Engineering Building)
Office Hours: Monday 4:30-6:30 pm; Wednesday 9:00 - 11:00
am.
General InformationProgramming Project: (pdf) (postscript)
Random Graph (A Perl script which generates random input files for the programming project)
Midterm Review: (pdf) (postscript)