Pages that link to "Item:Q4973889"
From MaRDI portal
The following pages link to Canonizing Graphs of Bounded Tree Width in Logspace (Q4973889):
Displaying 8 items.
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs (Q3113751) (← links)
- A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)