Fastest known deterministic algorithm for the undirected Graph Isomorphism problem What is the fastest known undirected graph isomorphism algorithm?
Babai invented the fastest known algorithm which runs in quasipolynomial time $2^{(\log n)^{O(1)}}$.