Pages that link to "Item:Q1935809"
From MaRDI portal
The following pages link to Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809):
Displaying 16 items.
- On the parameterized complexity of the multi-MCT and multi-MCST problems (Q630185) (← 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 computational complexity of the rooted subtree prune and regraft distance (Q1764471) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← 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)
- On the Complexity of Finding a Largest Common Subtree of Bounded Degree (Q2842767) (← links)
- Tractable and intractable variations of unordered tree edit distance (Q2929619) (← links)
- (Q5091018) (← links)
- Combinatorial Pattern Matching (Q5315356) (← links)
- Trees with large numbers of subtrees (Q5737871) (← links)
- Approximation and special cases of common subtrees and editing distance (Q6487427) (← links)
