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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Bouland, A., Dawar, A., & Kopczyński, E. (2012). On tractable parameterizations of graph isomorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7535 LNCS, pp. 218–230). https://doi.org/10.1007/978-3-642-33293-7_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
