Pages that link to "Item:Q6487427"
From MaRDI portal
The following pages link to Approximation and special cases of common subtrees and editing distance (Q6487427):
Displaying 11 items.
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
- On the approximation of largest common subtrees and largest common point sets (Q1575954) (← links)
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- Combinatorial Pattern Matching (Q5315356) (← links)