Improved MAX SNP-hard results for finding an edit distance between unordered trees

Authors:
Kouichi Hirata;Yoshiyuki Yamamoto;Tetsuji Kuboyama
Affiliations:
Department of Artificial Intelligence, Kyushu Institute of Technology, Iizuka, Japan;Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology, Iizuka, Japan;Computer Center, Gakushuin University, Tokyo, Japan
Venue:
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Year:
2011

Citing 8
Cited 5

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
On the editing distance between unordered labeled trees

Information Processing Letters
Some MAX SNP-hard results concerning unordered labeled trees

Information Processing Letters
Alignment of trees: an alternative to tree edit

Theoretical Computer Science
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
A survey on tree edit distance and related problems

Theoretical Computer Science
An optimal decomposition algorithm for tree edit distance

ACM Transactions on Algorithms (TALG)

Efficient exponential time algorithms for edit distance between unordered trees

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees

Theoretical Computer Science
Coloring based approach for matching unrooted and/or unordered trees

Pattern Recognition Letters
On the complexity of finding a largest common subtree of bounded degree

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Efficient exponential-time algorithms for edit distance between unordered trees

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.