Pages that link to "Item:Q1387834"
From MaRDI portal
The following pages link to Finding largest subtrees and smallest supertrees (Q1387834):
Displaying 8 items.
- A survey on tree edit distance and related problems (Q557823) (← links)
- On the parameterized complexity of the multi-MCT and multi-MCST problems (Q630185) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- Comparing and distinguishing the structure of biological branching (Q2351339) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- A management system for decompositions in stochastic programming (Q2507408) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- Largest Weight Common Subtree Embeddings with Distance Penalties (Q5005156) (← links)
