论文信息 - Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees

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.

Kouichi Hirata | Tetsuji Kuboyama | Yoshiyuki Yamamoto

[1] Kaizhong Zhang,et al. Exact and approximate algorithms for unordered tree matching , 1994, IEEE Trans. Syst. Man Cybern..

[2] Erik D. Demaine,et al. An optimal decomposition algorithm for tree edit distance , 2006, TALG.

[3] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.

[4] Erik D. Demaine,et al. An O(n^3)-Time Algorithm for Tree Edit Distance , 2005, ArXiv.

[5] Lusheng Wang,et al. Alignment of trees: an alternative to tree edit , 1995 .

[6] Philip Bille,et al. A survey on tree edit distance and related problems , 2005, Theor. Comput. Sci..

[7] Kaizhong Zhang,et al. On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..

[8] Viggo Kann,et al. Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[9] Tao Jiang,et al. Some MAX SNP-Hard Results Concerning Unordered Labeled Trees , 1994, Inf. Process. Lett..

[10] Kaizhong Zhang,et al. Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[11] Kuo-Chung Tai,et al. The Tree-to-Tree Correction Problem , 1979, JACM.

[12] Kaizhong Zhang,et al. On the Editing Distance Between Undirected Acyclic Graphs , 1996, Int. J. Found. Comput. Sci..