On the subtree isomorphism problem for ordered trees
An ordered tree \(T_ n\) is a rooted tree with n nodes that has an ordering prescribed for the subtrees incident with each node. The author shows that for any two ordered trees \(T_ m\) and \(T_ n\) there is an algorithm that determines whether \(T_ m\) is isomorphic to any subtree of \(T_ n\) in time \(O(m+n)\).
scientific article; zbMATH DE number 4112612