Improved approximation of the largest common subtree of two unordered trees of bounded height
From MaRDI portal
(Redirected from Publication:975557)
Recommendations
- On the complexity of finding a largest common subtree of bounded degree
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
- On the complexity of finding a largest common subtree of bounded degree
- On the approximation of largest common subtrees and largest common point sets
- Approximation and special cases of common subtrees and editing distance
Cites work
- A constrained edit distance between unordered labeled trees
- A survey on tree edit distance and related problems
- An Optimal Decomposition Algorithm for Tree Edit Distance
- Approximation and special cases of common subtrees and editing distance
- Introduction to algorithms
- On the editing distance between unordered labeled trees
- Some MAX SNP-hard results concerning unordered labeled trees
- The Tree-to-Tree Correction Problem
Cited in
(6)- scientific article; zbMATH DE number 1555958 (Why is no real title available?)
- On the complexity of finding a largest common subtree of bounded degree
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- On the complexity of finding a largest common subtree of bounded degree
- Efficient exponential-time algorithms for edit distance between unordered trees
This page was built for publication: Improved approximation of the largest common subtree of two unordered trees of bounded height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975557)
