On Tractable Parameterizations of Graph Isomorphism
- 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
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.
Unable to display preview. Download preview PDF.