Pages that link to "Item:Q4142684"
From MaRDI portal
The following pages link to An Analysis of a Good Algorithm for the Subtree Problem (Q4142684):
Displayed 19 items.
- Some comments on the subtree isomorphism problem for ordered trees (Q918705) (← links)
- Retrieving articulated 3-D models using medial surfaces (Q1008490) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- The subgraph isomorphism problem for outerplanar graphs (Q1056237) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- On the subtree isomorphism problem for ordered trees (Q1124598) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- On the approximation of largest common subtrees and largest common point sets (Q1575954) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- Relational object recognition from large structural libraries (Q1860135) (← links)
- Isomorphic tree spanner problems (Q1899446) (← links)
- Constrained tree inclusion (Q2569419) (← links)
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
- On generalization/specialization for conceptual graphs (Q4846732) (← links)
- Some complexity theoretic aspects of AC rewriting (Q5096174) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)