Restricted space algorithms for isomorphism on bounded treewidth graphs
From MaRDI portal
Publication:3113751
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Recommendations
- Restricted space algorithms for isomorphism on bounded treewidth graphs
- Canonizing Graphs of Bounded Tree Width in Logspace
- Isomorphism for graphs of bounded distance width
- Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs
- Canonizing graphs of bounded tree width in logspace
Cited in
(11)- An improved isomorphism test for bounded-tree-width graphs
- An improved isomorphism test for bounded-tree-width graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs
- Graphs of bounded treewidth can be canonized in AC\(^1\)
- Canonizing graphs of bounded tree width in logspace
- Restricted space algorithms for isomorphism on bounded treewidth graphs
- The isomorphism problem for \(k\)-trees is complete for logspace
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
- The Space Complexity of k-Tree Isomorphism
- Isomorphism for graphs of bounded connected-path-distance-width
This page was built for publication: Restricted space algorithms for isomorphism on bounded treewidth graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113751)
