Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871): Difference between revisions

@@ Property / cites work @@
+A survey on tree edit distance and related problems
+Normal rank
@@ Property / cites work @@
+An optimal decomposition algorithm for tree edit distance
+Normal rank
@@ Property / cites work @@
+Alignment of trees -- an alternative to tree edit
@@ Property / cites work: Alignment of trees -- an alternative to tree edit / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Exact and approximate algorithms for unordered tree matching
+Normal rank
@@ Property / cites work @@
+The Tree-to-Tree Correction Problem
@@ Property / cites work: The Tree-to-Tree Correction Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Some MAX SNP-hard results concerning unordered labeled trees
+Normal rank
@@ Property / cites work @@
+Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
+Normal rank
@@ Property / cites work @@
+On the editing distance between unordered labeled trees
+Normal rank
@@ Property / cites work @@
+ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
+Normal rank