Title: Laszlo Babai (University of Chicago): Graph Isomorphism in Quasipolynomial Time II: The “Split-or-Johnson routine” (Combinatorics and TCS seminar)
When: Tue Nov 24, 2015 3pm to 4pm CST
Where: Ry 251
Description: In this second talk of the series we present the details of the canonical partitioning algorithms required for the master algorithm. This is a stand-alone module and can be understood without knowledge of the master algorithm outlined in the first talk. Basic familiarity with discrete structures such as undirected and directed graphs, bipartite graphs, hypergraphs will be assumed. No group theory beyond the concept of the symmetric group is required.
Refreshments will be served before the talk in Ry 255.