DagRep.5.12.1.pdf
- Filesize: 1.13 MB
- 17 pages
Document
The Graph Isomorphism Problem (Dagstuhl Seminar 15511)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 5, Issue 12
Volume: Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-04-11
Cite AsGet BibTex
László Babai, Anuj Dawar, Pascal Schweitzer, and Jacobo Torán. The Graph Isomorphism Problem (Dagstuhl Seminar 15511). In Dagstuhl Reports, Volume 5, Issue 12, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/DagRep.5.12.1
https://doi.org/10.4230/DagRep.5.12.1
Abstract
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.
Keywords
- canonical forms
- complexity
- computational group theory
- graph isomorphism
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads