2026-07-24T11:52:20Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5802 2024-03-06T10:26:30Z ddc:004 open_access

The Graph Isomorphism Problem (Dagstuhl Seminar 15511) Babai, László Dawar, Anuj Schweitzer, Pascal Torán, Jacobo canonical forms complexity computational group theory graph isomorphism 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik László Babai and Anuj Dawar and Pascal Schweitzer and Jacobo Torán 2016 Is Part Of Dagstuhl Reports, Volume 5, Issue 12 (2016) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.5.12.1 urn:nbn:de:0030-drops-58028 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.12.1 eng https://creativecommons.org/licenses/by/3.0/legalcode