Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557)
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: Improved approximation of the largest common subtree of two unordered trees of bounded height |
scientific article; zbMATH DE number 5719260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation of the largest common subtree of two unordered trees of bounded height |
scientific article; zbMATH DE number 5719260 |
Statements
Improved approximation of the largest common subtree of two unordered trees of bounded height (English)
0 references
9 June 2010
0 references
approximation algorithms
0 references
edit distance
0 references
unordered trees
0 references
common subtrees
0 references
0.8915960192680359
0 references
0.8716990351676941
0 references
0.8677257895469666
0 references
0.8508545756340027
0 references
0.8497275710105896
0 references
