Further comments on the subtree isomorphism for ordered trees (Q1183481)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Further comments on the subtree isomorphism for ordered trees |
scientific article; zbMATH DE number 33323
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Further comments on the subtree isomorphism for ordered trees |
scientific article; zbMATH DE number 33323 |
Statements
Further comments on the subtree isomorphism for ordered trees (English)
0 references
28 June 1992
0 references
The author is concerned with the paper of \textit{E. Mäkinen} [On the subtree isomorphism problem for ordered trees; Inf. Process. Lett. 32, No. 5, 271-273 (1989; Zbl 0679.05024)], where Mäkinen gives an \(O(n)\)- algorithm for the subtree isomorphism problem. He clarifies that Mäkinen's algorithm works correctly by adding a further step to the original coding phase.
0 references
subtree isomorphism
0 references
Mäkinen's algorithm
0 references
