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

Ganeshkumar Ganapathysaravanabavan, Tandy J. Warnow

Browse the full WABI paper archive.