Reduction Techniques for Graph Isomorphism in the Context of Width Parameters

DOI10.1007/978-3-319-08404-6_32zbMath1416.68086arXiv1403.7238OpenAlexW2963091559MaRDI QIDQ3188910

Yota Otachi, Pascal Schweitzer

Publication date: 2 September 2014

Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.7238

Mathematics Subject Classification ID

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

Related Items (5)

An improved isomorphism test for bounded-tree-width graphs ⋮ Induced minor free graphs: isomorphism and clique-width ⋮ Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth ⋮ Benchmark Graphs for Practical Graph Isomorphism ⋮ Graph isomorphism restricted by lists

This page was built for publication: Reduction Techniques for Graph Isomorphism in the Context of Width Parameters