Isomorphism for graphs of bounded distance width
From MaRDI portal
Publication:1293880
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
(16)- Approximability of the path-distance-width for AT-free graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- On weak isomorphism of rooted vertex-colored graphs
- Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics
- Minimum eccentricity shortest path problem: an approximation algorithm and relation with the \(k\)-laminarity problem
- Minors in graphs of large \(\theta_r\)-girth
- Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
- Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
- Restricted space algorithms for isomorphism on bounded treewidth graphs
- Approximating the path-distance-width for AT-free graphs and graphs in related classes
- Restricted space algorithms for isomorphism on bounded treewidth graphs
- The isomorphism problem for \(k\)-trees is complete for logspace
- Graph isomorphism parameterized by elimination distance to bounded degree
- scientific article; zbMATH DE number 6503309 (Why is no real title available?)
- Colored hypergraph isomorphism is fixed parameter tractable
- Isomorphism for graphs of bounded connected-path-distance-width
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)
