Uploaded June 2020 | Updated November 2026, 1 day ago
Content leading up to the definition of treewidth: why CSPs and similar problems are usually easy on trees and series-parallel graphs (which are basically graphs of treewidth 2). Lecture 22(a) of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
Content leading up to the definition of treewidth: why CSPs and similar problems are usually easy on trees and series-parallel graphs (which are basically graphs of treewidth 2). Lecture 22(a) of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)










