Isomorphism for Graphs of Bounded Connected-Path-Distance-Width

DOI10.1007/978-3-642-35261-4_48zbMath1260.68183OpenAlexW213788650MaRDI QIDQ4909562

Yota Otachi

Publication date: 21 March 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_48

zbMATH Keywords

treewidthfixed-parameter tractabilitygraph isomorphismconnected-path-distance-width

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 (1)

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

This page was built for publication: Isomorphism for Graphs of Bounded Connected-Path-Distance-Width