Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Isomorphism Testing for Graphs Excluding Small Minors

IEEE via YouTube

Overview

Explore a 16-minute IEEE conference talk on graph isomorphism testing for graphs excluding small minors. Delve into the history and main results of the Graph Isomorphism Problem, focusing on t-CR-bounded graphs. Learn about key decomposition techniques, including the Main Decompositions Theorem, and their application in developing a quasipolynomial-time isomorphism algorithm. Discover how these concepts relate to finding "Patient Zero" in infection spread models. Gain insights from experts Martin Grohe, Daniel Neuen, and Daniel Wiebking as they present their research and discuss future perspectives in this fascinating area of graph theory and algorithms.

Syllabus

Intro
Graph Isomorphism Problem
History and Main Result
Main Decompositions Result
t-CR-bounded graphs
Finding Patient Zero
How the Infection Spreads?
Main Decompositions Theorem
Quasipolynomial-time isomorphism algorithm
Outlook

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Isomorphism Testing for Graphs Excluding Small Minors

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.