Finding largest subtrees and smallest supertrees
From MaRDI portal
Publication:1387834
DOI10.1007/PL00009212zbMath0896.68103OpenAlexW2002116543MaRDI QIDQ1387834
Arvind Kumar Gupta, Naomi Nishimura
Publication date: 8 June 1998
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009212
Related Items (10)
On the parameterized complexity of the multi-MCT and multi-MCST problems ⋮ Largest Weight Common Subtree Embeddings with Distance Penalties ⋮ Maximum agreement and compatible supertrees ⋮ A survey on tree edit distance and related problems ⋮ Fixed-Parameter Algorithms for Finding Agreement Supertrees ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ A management system for decompositions in stochastic programming ⋮ An algebraic view of the relation between largest common subtrees and smallest common supertrees ⋮ FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT ⋮ Comparing and distinguishing the structure of biological branching
This page was built for publication: Finding largest subtrees and smallest supertrees
