Graph-Theoretic Algorithms
Spring 2020
Delivery

UW Logo

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.)

Other resources/info:
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  


Webmaster:
Last modified: 05/01/2020