Uploaded June 2020 | Updated November 2026, 1 day ago
Algorithms for finding/approximating the treewidth of a graph, as well as efficient algorithms for solving NP-hard problems on graphs of constant treewidth. Lecture 22(c) 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.
Resource for this lecture:
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/)
Algorithms for finding/approximating the treewidth of a graph, as well as efficient algorithms for solving NP-hard problems on graphs of constant treewidth. Lecture 22(c) 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.
Resource for this lecture:
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/)










