Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs

DOI10.1007/978-3-319-15612-5_30zbMath1432.68348OpenAlexW69421514MaRDI QIDQ5176596

Bireswar Das, I. Vinod Reddy, Murali Krishna Enduri

Publication date: 27 February 2015

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15612-5_30

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Polynomial-time algorithm for isomorphism of graphs with clique-width at most three

This page was built for publication: Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs