Convex tree realizations of partitions

Abstract

AbstractGiven a collection P of partitions of a label set L a problem arising in biological and linguistic classification is deciding whether there is a “tree-structure” on L which is “compatible” with P. While this problem is, in general, N P-complete we show that it has a polynomial time solution if the number of sets in each partition is at most three