On the complexity of finding a largest common subtree of bounded degree (Q2842767)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6199045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding a largest common subtree of bounded degree |
scientific article; zbMATH DE number 6199045 |
Statements
On the Complexity of Finding a Largest Common Subtree of Bounded Degree (English)
0 references
16 August 2013
0 references
tree edit distance
0 references
unordered trees
0 references
dynamic programming
0 references
parameterized complexity
0 references
0.9844780564308168
0 references
0.8677257895469666
0 references
0.8341084718704224
0 references
0.8183902502059937
0 references
