Pages that link to "Item:Q5387816"
From MaRDI portal
The following pages link to The Space Complexity of k-Tree Isomorphism (Q5387816):
Displaying 9 items.
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree (Q802874) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
- The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
- (Q3334090) (← links)
- A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
- (Q4258575) (← links)