An Analysis of a Good Algorithm for the Subtree Problem
From MaRDI portal
Publication:4142684
DOI10.1137/0206053zbMath0366.68026MaRDI QIDQ4142684
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
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
68W99: Algorithms in computer science
Related Items
On generalization/specialization for conceptual graphs, Some comments on the subtree isomorphism problem for ordered trees, 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, Subgraph isomorphism for biconnected outerplanar graphs in cubic time, Relational object recognition from large structural libraries, Isomorphic tree spanner problems, Constrained tree inclusion