Abstract
The Maximum Agreement Forest problem (MAF) asks for the largest common subforest of a set of binary trees. This problem is known to be MAXSNP-complete for instances consisting of 2 trees. We show that it remains MAXSNP-complete for k ⩾ 2 trees.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have