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 this page instead for the normal view: On the Complexity of Finding a Largest Common Subtree of Bounded Degree |
scientific article; zbMATH DE number 6199045
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
