On the subtree isomorphism problem for ordered trees (Q1124598): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Pattern Matching in Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new algorithm for solving the tree isomorphism problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Analysis of a Good Algorithm for the Subtree Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lexicographic generation of ordered trees / rank | |||
Normal rank | |||
Latest revision as of 10:26, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the subtree isomorphism problem for ordered trees |
scientific article |
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
