Pages that link to "Item:Q1293880"
From MaRDI portal
The following pages link to Isomorphism for graphs of bounded distance width (Q1293880):
Displaying 15 items.
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- On weak isomorphism of rooted vertex-colored graphs (Q1627179) (← links)
- Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics (Q2195553) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree (Q2946014) (← links)
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (Q2958315) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs (Q3113751) (← links)
- Reduction Techniques for Graph Isomorphism in the Context of Width Parameters (Q3188910) (← links)
- (Q3450100) (← links)
