Abstract
Zhang and Jiang (1994) have shown that the problem of finding an edit distance between unordered trees is MAX SNP-hard. In this paper, we show that this problem is MAX SNP-hard, even if (1) the height of trees is 2, (2) the degree of trees is 2, (3) the height of trees is 3 under a unit cost, and (4) the degree of trees is 2 under a unit cost. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Hirata, K., Yamamoto, Y., & Kuboyama, T. (2011). Improved MAX SNP-hard results for finding an edit distance between unordered trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 402–415). https://doi.org/10.1007/978-3-642-21458-5_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
