On the complexity of finding a largest common subtree of bounded degree (Q2348030)
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 6444668
| 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 6444668 |
Statements
On the complexity of finding a largest common subtree of bounded degree (English)
0 references
10 June 2015
0 references
tree edit distance
0 references
unordered trees
0 references
dynamic programming
0 references
parameterized complexity
0 references
0 references
0.9844780564308168
0 references
0.8915960192680359
0 references
0.8514161109924316
0 references
0.8332846164703369
0 references
0.8255607485771179
0 references
