Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time

DOI10.1007/3-540-44696-6_12zbMath1128.05314OpenAlexW1527979405MaRDI QIDQ4801149

Ganeshkumar Ganapathysaravanabavan, Tandy J. Warnow

Publication date: 6 April 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44696-6_12

Mathematics Subject Classification ID

Trees (05C05) Taxonomy, cladistics, statistics in mathematical biology (92B10) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Improved algorithms for maximum agreement and compatible supertrees ⋮ Maximum agreement and compatible supertrees ⋮ On the approximability of the maximum agreement subtree and maximum compatible tree problems

This page was built for publication: Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time