A linear time and space algorithm for finding isomorphic subtrees of a binary tree (Q802874)
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: A linear time and space algorithm for finding isomorphic subtrees of a binary tree |
scientific article; zbMATH DE number 4199635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time and space algorithm for finding isomorphic subtrees of a binary tree |
scientific article; zbMATH DE number 4199635 |
Statements
A linear time and space algorithm for finding isomorphic subtrees of a binary tree (English)
0 references
1991
0 references
isomorphic subtrees
0 references
binary tree
0 references
0 references
0 references
0.87232757
0 references
0 references
0 references
0.87133527
0 references
0.87121934
0 references
0.8693473
0 references
0.8672837
0 references
