Isomorphism for graphs of bounded distance width

DOI10.1007/PL00009273zbMath0934.68071OpenAlexW1987968444MaRDI QIDQ1293880

Hans L. Bodlaender, Koichi Yamazaki, Babette de Fluiter, Dimitrios M. Thilikos

Publication date: 29 June 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009273

zbMATH Keywords

graph isomorphism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Graph isomorphism parameterized by elimination distance to bounded degree ⋮ Minors in graphs of large \(\theta_r\)-girth ⋮ Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem ⋮ Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics ⋮ Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth ⋮ Approximating the path-distance-width for AT-free graphs and graphs in related classes ⋮ Colored hypergraph isomorphism is fixed parameter tractable ⋮ The isomorphism problem for \(k\)-trees is complete for logspace ⋮ Restricted space algorithms for isomorphism on bounded treewidth graphs ⋮ Approximability of the Path-Distance-Width for AT-free Graphs

This page was built for publication: Isomorphism for graphs of bounded distance width