Pages that link to "Item:Q5002745"
From MaRDI portal
The following pages link to An improved isomorphism test for bounded-tree-width graphs (Q5002745):
Displaying 9 items.
- Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- (Q5089162) (← links)
- (Q5090449) (← links)
- Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
- A Faster Isomorphism Test for Graphs of Small Degree (Q6139827) (← links)