A good algorithm is analyzed for deciding if one tree is a subtree of another tree. If both trees are rooted, the smaller tree has n vertices and the larger has m vertices; then the total number of computations is O(nm1.5) or better, depending on how good an algorithm one has for a maximal matching in a bipartite graph.
No takes yet. Share an insight, caveat, or question.
Steven W. Reyner (1977) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: