(August 17, 2017) One final update to the
lecture notes cleans up much in the last few chapters.
(late June, 2017) Assignment 3 is now posted. Due date July 7.
(June 22, 2017) The newest version of the
lecture notes adds much more material to Chapter 15 (dynamic programming in partial k-trees).
(June 21, 2017) I have updated the time slots, both for the
project-meetings and for final exams. Please email me which slot
you would like to have. (Please email me 5 different slots that would
work for you, so that I can schedule things suitably.)
(June 5, 2017) The due date for assignment 2 has been moved
to Tuesday, June 13, 23:59pm.
(June 1, 2017) The newest version of the
lecture notes changes the proof of lexBFS, and re-arranges Chapter 11 (tree decomposition) to be closer to how we did this in class.
(May 29, 2017) Assignment 2 is now posted. Due date June 9.
(May 23, 2017) The newest version of the
lecture notes adds the proof that 4-connected triangulated graphs have a Hamiltonian Cycle
and shifts chapter-numbers by keeping everything about triangulations together.
There will be another update soon, affecting mostly Chapter 10 (recognizing chordal graphs).
(May 7, 2017) Assignment 1 is now posted. Due date May 19.
(April 13, 2017) The course is currently full. If you would like to
be on the waiting list, please email me,
and state your motivation for taking the course, as well as what relevant courses you have
taken already. (Decisions about enrollment extra students may not happen
until early May; please attend the first few classes even if not enrolled yet.)
(April 2017) Welcome to Graph-theoretic Algorithms!
The first meeting will be on Monday, May 1, 10am, in DC 2568.
Classes will run for approximately 2 hours (but not on all Mon/Wed
of the term).