On the complexity of finding a largest common subtree of bounded degree (Q2348030)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding a largest common subtree of bounded degree |
scientific article |
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 references
