CMPE277 Graph Algorithms

Martine Schlag
Fall 2006

Welcome to the evolving 277 Home Page

Send email to your instructor

Homework Assignments

• Homework 6: due Thursday November 30, at the beginning of class (10:00am).
• Homework 5: due Tuesday November 21, at the beginning of class (10:00am).
• Homework 4: due Tuesday October 31, at the beginning of class (10:00am).
• Homework 3: due Thursday October 19, at the beginning of class (10:00am).
• Homework 2: due Thursday October 12, at the beginning of class (10:00am).
• Homework 1: due Tuesday October 3, at the beginning of class (10:00am).

Resources

• The PageRank Citation Ranking: Bringing Order to the Web.
• Control Algorithms for Rearrangeable Clos Networks

Course Information

• Prerequisite: CS 101 and (CS 102 or CE 177 or CS201) or consent of instructor.
• Syllabus (tentative)
• Text: Graphs, Networks & Algorithms (2nd Edition) by Dieter Jungnickel
  Springer, 2004 ISBN 3540219056
  
• Lecture: TuTh 10:00-11:45am Soc Sci 2 363
• Instructor: Martine Schlag
  E2 219 (northwest corner)
  martine@cse.ucsc.edu
  (831)459-3243
  Office Hours: Monday 10-11am and Wednesday 10-11am

• Requesting academic accommodations

Other Information

• SOE home page
• Murphy's Law
• Unacceptable proof techniques

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