Explore induced subgraphs and tree decompositions in this 53-minute lecture by Maria Chudnovsky from Princeton University, presented at the 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021). Delve into advanced graph theory concepts and their applications in combinatorial algorithms. Gain insights into the relationship between induced subgraphs and tree decompositions, and understand their significance in solving complex graph problems. Learn from a renowned expert in the field as she shares cutting-edge research and techniques in this specialized area of mathematics and computer science.
Overview
Syllabus
Induced subgraphs and tree decompositions
Taught by
Fields Institute
Related Courses
-
Forbidding Induced Subgraphs - Structure and Algorithms
-
Approximation Algorithms for Hitting Subgraphs
-
Induced Subgraphs and Pathwidth - Characterizing Bounded Pathwidth Through Graph Theory
-
On the Oriented Coloring of the Disjoint Union of Graphs
-
Counting Small Induced Subgraphs Satisfying Monotone Properties
-
Introduction to Length-Constrained Expanders and Expander Decompositions
