On Tractable Parameterizations of Graph Isomorphism

DOI10.1007/978-3-642-33293-7_21zbMath1350.68130OpenAlexW82096150WikidataQ58215503 ScholiaQ58215503MaRDI QIDQ4899255

Adam Bouland, Anuj Dawar, Eryk Kopczyński

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

Graph isomorphism parameterized by elimination distance to bounded degree ⋮ Isomorphism testing for \(T\)-graphs in FPT ⋮ A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs ⋮ Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs ⋮ Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics ⋮ Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth ⋮ A note on the connected game coloring number ⋮ On the Parameterized Complexity of Clique Elimination Distance ⋮ Unnamed Item

This page was built for publication: On Tractable Parameterizations of Graph Isomorphism