Learn Backend Development Part-Time, Online
Build the Finance Skills That Lead to Promotions — Not Just Certificates
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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