|   | |
Graph-Theoretic Algorithms
|
| Resources | Outline | Summaries | Project | Exams | Delivery |
The class will be completely delivered online, through a mix of PDF-notes and videos. The LEARN page (under "Content") gives you, for each lecture, a number components to work through. (Students that are not registered but want to "sit in": Contact the instructor for direct links to videos/notes, but they will not be structured as nicely.)
If you have questions, please mark them as annotations directly at Perusall; I will be monitoring the annotations and clarify (possibly in the next online meeting) as needed.
If you understood everything from the next then you could skip the videos. But I recommend watching them anyway.
The videos are .webm files which most built-in video players should be able to read (but I am told that some Mac video players had trouble). If need be, install VLC. Here is a small sample video to try it out.
You can usually ignore these. They are here because the video is sometimes blurry so that you can't see exactly what was written. And sometimes the pages in the video are not quite what was in the lecture notes (due to later improvements of those lecture notes) . So perhaps you find these useful.
The deadline for these is the day after the corresponding lecture-date. It should only take a few minutes to do them, so do them as soon as you have read/watched!
Upload the answer (preferably in latex in PDF) to the Dropbox on LEARN. Note that latex can easily include photos of handdrawn pictures, and this is acceptable to use. Do not skimp on pictures; they really help me understand what you mean.
The deadline is 2 weeks after the corresponding lecture-date.
A few meta-comments that apply to all quizzes/assignments:
No new material is covered here (and they are completely optional). If there are no student-questions, then I do tutorial-style things, perhaps go over the lecture notes pages again, or answer some of the reinforcement-questions from the lecture notes. In later office hours, I might also go over the solutions to assignment-questions.
As you can tell, the course will run on a somewhat condensed schedule (each lecture will be equivalent to about 2 hours class time). Unless we are on a complete lockdown, I will be away (with very limited internet access) from mid-July to early August.
| Lecture | Content | Reference |
|---|---|---|
| Lecture 1 (Tue, May 12, 2020) | Intro to planar graphs   | Ch.1, Ch.2.1 (skip 2.1.5), 2.2   |
| Lecture 2 (Thu, May 14, 2020) | Solving problems in planar graphs   | Ch. 2.3-4   |
| Lecture 3 (Tue, May 19, 2020) | NP-hardness. Maximum Flow   | Ch 3. Ch. 5.1,5.3   |
| Lecture 4 (Thu, May 21, 2020) | Planarity testing. Triangulated graphs   | Ch. 6,7.2   |
| Lecture 5 (Tue, May 26, 2020) | Canonical ordering and uses   | Ch. 7.4,7.5 (skip 7.5.6)   |
| Lecture 6 (Thu, May 28, 2020) | Friends of planar graphs   | Ch. 8   |
| Lecture 7 (Tue, Jun 02, 2020) | Interval graphs and chordal graphs   | Ch. 9, 10.1   |
| Lecture 8 (Thu, Jun 04, 2020) | Recognizing interval graphs. Tree decompositions   | Ch. 10.2-3, 11.1-2   |
| Lecture 9 (Tue, Jun 09, 2020) | Partial k-trees and treewidth   | Ch. 11.3-5 (omit 11.5.3)   |
| Lecture 10 (Thu, Jun 11, 2020) | SP-graphs. Branchwidth.   | Ch. 12.1, 12.2 (skip 12.2.1), 13   |
| Lecture 11 (Tue, Jun 16, 2020) | Pathwidth, cutwidth and friends   | Ch. 14.1, 14.3-7   |
| Lecture 12 (Thu, Jun 18, 2020) | Trees and dynamic programming   | Ch. 15.1-2   |
| Lecture 13 (Tue, Jun 23, 2020) | Dynamic programming in partial k-trees   | Ch. 15.3-5   |
| Lecture 14 (Thu, Jun 25, 2020) | MSOL. k-outer-planar graphs   | Ch. 15.6, 16   |
| Lecture 15 (Tue, Jun 30, 2020) | Balanced separators   | Ch. 17.1-5   |
| Lecture 16 (Thu, Jul 02, 2020) | Applications of separators   | Ch. 17.6, 18.1   |
| Lecture 17 (Tue, Jul 07, 2020) | Grid minors. Bidimensionality   | Ch. 18.2-3, 19.1   |
| Lecture 18 (Thu, Jul 09, 2020) | WQO and Graph Minor Theorem   | Ch. 19.2-4, 20   |