CMPE177
Applied Graph Theory and Algorithms

Welcome to the evolving 177 Home Page

Send email to your instructor

Final Exam: Wednesday 4-7pm

Project Description

Homework Assignments

• Homework 5: due Thursday Dec. 2, beginning of class.
• Homework 4: due Thursday Nov. 18, beginning of class.
• Homework 3: due Thursday Oct. 28, beginning of class.
• Homework 2: due Thursday Oct. 14, beginning of class.
• Homework 1: (extended) due Thursday Oct. 7 beginning of class (2pm).

Course Resources

• Slides
• Discussion: cmpe177 forum
  

• Handouts
  1. The Matrix-Tree Theorem (postscript) (pdf)
  2. Breadth First Search(postscript) (pdf)
  3. Dijkstra's Shortest Path Algorithm (postscript) (pdf)
  4. Depth First Search(postscript) (pdf)
  5. Cut Vertices and Biconnected Components (postscript) (pdf)
  6. Finding Strongly Connected Components with DFS(postscript) (pdf)
  7. Demoucron's Planarity Algorithm(postscript) (pdf)
• Text: A First Look at Graph Theory by John Clark and Derek Allan Holton.
  World Scientific 1991. Paperback. ISBN 981-02-0490-6
  Here's another source for the book.
  Errata Let me know if you find more.

Course Information

• Time and Place: TuTh 2:00-3:45 Baskin Engr. 156
• Lab hours: Baskin Engineering 105: Tu 10-12pm and W 10-12pm.
  This lab has SUN workstations. Students working on their CMPE177 projects will have priority on the workstations during these hours.
• Staff:
• Instructor: Martine Schlag
  E2 219 (northwest corner)
  (831)459-3243
  Office Hours: Tues. 10:30-11:30am and Wed. 9:30-10:30am
• 0.5 TA: Gefan Zhang gefan@soe.ucsc.edu
  Office Hours: Mon: 11am-12pm Wed: 2pm-3pm Fri: 11am-12pm
  Held in BE 354I.
  (Gefan will leave if no one shows up in the first 15 minutes. Send e-mail if you need to arrive later.)
• Grading
• Syllabus
• Requesting academic accommodations

Portions of the CMPE177 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited.