Pages that link to "Item:Q1575954"
From MaRDI portal
The following pages link to On the approximation of largest common subtrees and largest common point sets (Q1575954):
Displaying 11 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)
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics (Q1713404) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- (Q2753922) (← links)
- On the Complexity of Finding a Largest Common Subtree of Bounded Degree (Q2842767) (← links)
- About the largest subtree common to several X-trees (Q3010530) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- Finding largest common embeddable subtrees (Q4596639) (← links)
- Largest Weight Common Subtree Embeddings with Distance Penalties (Q5005156) (← links)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)