Algorithms for Bounded Treewidth || @ CMU || Lecture 22(c) of CS Theory Toolkit @RyanODonnellTeaching
Algorithms for Bounded Treewidth || @ CMU || Lecture 22(c) of CS Theory Toolkit  @RyanODonnellTeaching
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 Bounded Treewidth || @ CMU || Lecture 22(c) of CS Theory ToolkitSemidefinite relaxation problems || @ CMU || Recitation 10 of CS Theory ToolkitThe Math Behind Quantum Algorithms (in Scratch!)Quantum Monte Carlo: Mean Estimation when you have the source codeMin-st-Cut is the dual LP of Max-st-Flow || @ CMU || Lecture 18d of CS Theory ToolkitRounding LP Solutions: Min-Vertex-Cover || @ CMU || Lecture 18c of CS Theory ToolkitLearning About Quantum States 2:  Quantum Dice, and Measurements#17/100: Unnormalized states || Quantum Computer Programming in 100 Easy Lessons#85/100: We need to find the length of a cycle || Quantum Computer Programming in 100 Easy Lessonsk-wise Independent Generators || @ CMU || Lecture 12c of CS Theory Toolkit#1/100: Toggling qubits || Quantum Computer Programming in 100 Easy Lessons#19/100: How Toggles Detective works (Part 2/2) || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Algorithms for Bounded Treewidth || @ CMU || Lecture 22(c) of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER