scientific article; zbMATH DE number 1335884
From MaRDI portal
Publication:4258575
zbMATH Open0935.68037MaRDI QIDQ4258575FDOQ4258575
Authors: Birgit Jenner, Pierre McKenzie, Jacobo Torán 
Publication date: 4 May 2000
Title of this publication is not available (Why is that?)
Recommendations
- On the Hardness of Graph Isomorphism
- On the complexity of isoperimetric problems on trees
- Complexity of tree homomorphisms
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- A note on the subtree isomorphism for ordered trees and related problems
- The Space Complexity of k-Tree Isomorphism
- Tree-Depth and the Formula Complexity of Subgraph Isomorphism
- On the subtree isomorphism problem for ordered trees
- Strong hardness of approximation for tree transversals
- Isomorphic tree spanner problems
Cited In (7)
- Completeness results for graph isomorphism.
- Inverse monoids: decidability and complexity of algebraic questions.
- Title not available (Why is that?)
- On the isomorphism problem for decision trees and decision lists
- Partially commutative inverse monoids.
- Monomials, multilinearity and identity testing in simple read-restricted circuits
- The Space Complexity of k-Tree Isomorphism
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258575)
