License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.5.12.1
URN: urn:nbn:de:0030-drops-58028
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5802/
Go back to Dagstuhl Reports

Babai, László ; Dawar, Anuj ; Schweitzer, Pascal ; Torán, Jacobo
Weitere Beteiligte (Hrsg. etc.): László Babai and Anuj Dawar and Pascal Schweitzer and Jacobo Torán

The Graph Isomorphism Problem (Dagstuhl Seminar 15511)

pdf-format:
dagrep_v005_i012_p001_s15511.pdf (1 MB)

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.

BibTeX - Entry

@Article{babai_et_al:DR:2016:5802,
  author =	{L{\'a}szl{\'o} Babai and Anuj Dawar and Pascal Schweitzer and Jacobo Tor{\'a}n},
  title =	{{The Graph Isomorphism Problem (Dagstuhl Seminar 15511)}},
  pages =	{1--17},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{12},
  editor =	{L{\'a}szl{\'o} Babai and Anuj Dawar and Pascal Schweitzer and Jacobo Tor{\'a}n},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5802},
  URN =		{urn:nbn:de:0030-drops-58028},
  doi =		{10.4230/DagRep.5.12.1},
  annote =	{Keywords: canonical forms, complexity, computational group theory, graph isomorphism}
}

Keywords: canonical forms, complexity, computational group theory, graph isomorphism
Collection: Dagstuhl Reports, Volume 5, Issue 12
Issue Date: 2016
Date of publication: 11.04.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI