YoVDO

Trees and Series-Parallel Graphs - Lecture 22a of CS Theory Toolkit

Offered By: Ryan O'Donnell via YouTube

Tags

Theoretical Computer Science Courses Constraint Satisfaction Problems Courses

Course Description

Overview

Explore the concept of treewidth in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Delve into why Constraint Satisfaction Problems (CSPs) and similar computational challenges are typically easier to solve on trees and series-parallel graphs. Learn about graphs with treewidth 2 and their properties. Examine tree examples, series-parallel graphs, and work through exercises to reinforce understanding. Gain valuable insights into fundamental concepts in theoretical computer science, preparing for advanced research in the field.

Syllabus

Introduction
Tree example
Seriesparallel graphs
Example
SeriesParallel Graph
Exercise


Taught by

Ryan O'Donnell

Related Courses

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera