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.
Overview
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
Tags
Related Courses
-
Towards Better Approximation of Graph Crossing Number
-
Planar Graphs Have Bounded Queue-Number
-
Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization
-
Adjacency Labelling for Planar Graphs - and Beyond
-
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
-
High-Precision Estimation of Random Walks in Small Space
