Isomorphism Testing for Graphs Excluding Small Minors

Isomorphism Testing for Graphs Excluding Small Minors

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.