YoVDO

Induced Subgraphs and Tree Decompositions

Offered By: Fields Institute via YouTube

Tags

Graph Theory Courses Combinatorial Algorithms Courses

Course Description

Overview

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.

Syllabus

Induced subgraphs and tree decompositions


Taught by

Fields Institute

Related Courses

Comparing Genes, Proteins, and Genomes (Bioinformatics III)
University of California, San Diego via Coursera Molecular Evolution (Bioinformatics IV)
University of California, San Diego via Coursera Approximation Algorithms for Hitting Subgraphs
Fields Institute via YouTube Reconfiguring Simple ST Hamiltonian Paths in Rectangular Grid Graphs
Fields Institute via YouTube How to Allow Deep Learning on Your Data Without Revealing Your Data
Institute for Pure & Applied Mathematics (IPAM) via YouTube