Some MAX SNP-hard results concerning unordered labeled trees (Q1318750): Difference between revisions

@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+Ordered and Unordered Tree Inclusion
@@ Property / cites work: Ordered and Unordered Tree Inclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Threshold decomposition of gray-scale morphology into binary morphology
+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