Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A survey on tree edit distance and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Decomposition Algorithm for Tree Edit Distance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Tree-to-Tree Correction Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the editing distance between unordered labeled trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some MAX SNP-hard results concerning unordered labeled trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A constrained edit distance between unordered labeled trees / rank | |||
Normal rank | |||
Latest revision as of 22:26, 2 July 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
