Isomorphism for graphs of bounded distance width
From MaRDI portal
Publication:1293880
DOI10.1007/PL00009273zbMATH Open0934.68071OpenAlexW1987968444MaRDI QIDQ1293880FDOQ1293880
Authors: Koichi Yamazaki, Hans L. Bodlaender, 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
Recommendations
- Isomorphism for graphs of bounded connected-path-distance-width
- Restricted space algorithms for isomorphism on bounded treewidth graphs
- Restricted space algorithms for isomorphism on bounded treewidth graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- On tractable parameterizations of graph isomorphism
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
- Approximability of the path-distance-width for AT-free graphs
- 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
- 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)
