On the subtree isomorphism problem for ordered trees (Q1124598)
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: On the subtree isomorphism problem for ordered trees |
scientific article; zbMATH DE number 4112612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the subtree isomorphism problem for ordered trees |
scientific article; zbMATH DE number 4112612 |
Statements
On the subtree isomorphism problem for ordered trees (English)
0 references
1989
0 references
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)\).
0 references
isomorphism problem
0 references
ordered tree
0 references
0.8633009195327759
0 references
0.863175094127655
0 references
0.8614541888237
0 references
0.8494405746459961
0 references
0.849327802658081
0 references
