An Analysis of a Good Algorithm for the Subtree Problem

DOI10.1137/0206053MaRDI QIDQ4142684zbMATH OpenOpenAlexFDO

Authors Steven W. Reyner

Publication date 1977

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0206053

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(20)

• Retrieving articulated 3-D models using medial surfaces
• Approximate labelled subtree homeomorphism
• The subgraph isomorphism problem for outerplanar graphs
• Subtree isomorphism is NC reducible to bipartite perfect matching
• On the subtree isomorphism problem for ordered trees
• Tight complexity bounds for term matching problems
• On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
• Maximum tree-packing in time \(O(n^{5/2})\)
• On the approximation of largest common subtrees and largest common point sets
• On retracts, absolute retracts, and foldings in cographs
• Subgraph isomorphism for biconnected outerplanar graphs in cubic time
• Relational object recognition from large structural libraries
• Isomorphic tree spanner problems
• Constrained tree inclusion
• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
• On generalization/specialization for conceptual graphs
• Some complexity theoretic aspects of AC rewriting
• Maximum tree-packing in time O(n5/2)
• Finding smallest supertrees
• Some comments on the subtree isomorphism problem for ordered trees

This page was built for publication: An Analysis of a Good Algorithm for the Subtree Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4142684)