Ganeshkumar Ganapathysaravanabavan, Tandy Warnow. Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time. In Olivier Gascuel, Bernard M. E. Moret, editors, Algorithms in Bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings. Volume 2149 of Lecture Notes in Computer Science, pages 156-163, Springer, 2001. [doi]
Abstract is missing.