The Graph Isomorphism Problem (Dagstuhl Seminar 15511)
László Babai, Anuj Dawar, Pascal Schweitzer, Jacobo Torán · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016
This report documents the program and the outcomes of Dagstuhl Seminar 15511 "The Graph Isomorphism Problem". The goal of the seminar was to bring together researchers working on the numerous topics closely related to the Isomorphism Problem to foster their collaboration. To this end the participants of the seminar included researchers working on the theoretical and practical aspects of isomorphism ranging from the fields of algorithmic group theory, finite model theory, combinatorial optimization to algorithmics. A highlight of the conference was the presentation of a new quasi-polynomial time algorithm for the Graph Isomorphism Problem, providing the first improvement since 1983.