Pages that link to "Item:Q975557"
From MaRDI portal
The following pages link to Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557):
Displaying 6 items.
- 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)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- On the Complexity of Finding a Largest Common Subtree of Bounded Degree (Q2842767) (← links)