On Tractable Parameterizations of Graph Isomorphism

  • Adam Bouland
  • Anuj Dawar
  • Eryk Kopczyński
Conference paper

DOI: 10.1007/978-3-642-33293-7_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7535)
Cite this paper as:
Bouland A., Dawar A., Kopczyński E. (2012) On Tractable Parameterizations of Graph Isomorphism. In: Thilikos D.M., Woeginger G.J. (eds) Parameterized and Exact Computation. IPEC 2012. Lecture Notes in Computer Science, vol 7535. Springer, Berlin, Heidelberg

Abstract

The fixed-parameter tractability of graph isomorphism is an open problem with respect to a number of natural parameters, such as tree-width, genus and maximum degree. We show that graph isomorphism is fixed-parameter tractable when parameterized by the tree-depth of the graph. We also extend this result to a parameter generalizing both tree-depth and max-leaf-number by deploying new variants of cops-and-robbers games.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Adam Bouland
    • 1
  • Anuj Dawar
    • 2
  • Eryk Kopczyński
    • 3
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA
  2. 2.University of CambridgeCambridgeUK
  3. 3.University of WarsawWarsawPoland

Personalised recommendations