Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

Viet Tung Hoang, Wing-Kin Sung

Consider a set of labels $L$ and a set of trees ${\mathcal T} = \{{\mathcal T}^{(1), {\mathcal T}^{(2), ..., {\mathcal T}^{(k) \$ where each tree ${\mathcal T}^{(i)$ is distinctly…