Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees
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.
KeywordsUnit Cost Edit Distance Edit Operation Polynomial Time Approximation Scheme Left Child
Unable to display preview. Download preview PDF.
- 2.Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6 (2009)Google Scholar