Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076999762 / rank | |||
Normal rank | |||
Revision as of 21:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation of the largest common subtree of two unordered trees of bounded height |
scientific article |
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
