Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2008.09.025
+Normal rank
@@ Property / OpenAlex ID @@
+W2076999762
@@ Property / OpenAlex ID: W2076999762 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on tree edit distance and related problems
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Decomposition Algorithm for Tree Edit Distance
+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 @@
+On the editing distance between unordered labeled trees
+Normal rank
@@ Property / cites work @@
+Some MAX SNP-hard results concerning unordered labeled trees
+Normal rank
@@ Property / cites work @@
+A constrained edit distance between unordered labeled trees
+Normal rank