Isomorphism for graphs of bounded distance width

DOI10.1007/PL00009273zbMATH Open0934.68071OpenAlexW1987968444MaRDI QIDQ1293880FDOQ1293880

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)

Cited In (13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293880)