Dress A, STEEL M. Convex tree realizations of partitions. Applied Mathematics Letters. 1992;5(3):3-6.Given 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, NP-complete we show that it has a polynomial time solution if the number of sets in each partition is at most three
The concept of convex extendability is introduced to answer the problem of finding the smallest dis...
AbstractA central problem that arises in evolutionary biology is that of displaying partitions of su...
A coloring of the leaves of a tree T is called convex, if it is possible to give each internal node ...
AbstractGiven a collection P of partitions of a label set L a problem arising in biological and ling...
Let T be an unrooted binary tree with n distinctly labelled leaves. Deriving its name from the field...
It was recently shown that just five characters (functions on a finite set X) suffice to convexly de...
AbstractIt is known that a tree convex network is globally consistent if it is path consistent. Howe...
International audienceThe Tree Containment problem has many important applications in the study of e...
We introduce a strong extended formulation of the convex recoloring prob- lem on a tree, which has a...
A coloring of a graph is convex if it induces a partition of the vertices into connected sub-graphs....
In this paper we prove that it is NP-complete to decide whether a graph can be partitioned into nont...
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a s...
AbstractGiven a family ofbinarycharacters defined on a setX, a problem arising in biological and lin...
We present an efficient algorithm that decides the consistency of partial descriptions of ordered t...
AbstractList partitions generalize list colourings. Sandwich problems generalize recognition problem...
The concept of convex extendability is introduced to answer the problem of finding the smallest dis...
AbstractA central problem that arises in evolutionary biology is that of displaying partitions of su...
A coloring of the leaves of a tree T is called convex, if it is possible to give each internal node ...
AbstractGiven a collection P of partitions of a label set L a problem arising in biological and ling...
Let T be an unrooted binary tree with n distinctly labelled leaves. Deriving its name from the field...
It was recently shown that just five characters (functions on a finite set X) suffice to convexly de...
AbstractIt is known that a tree convex network is globally consistent if it is path consistent. Howe...
International audienceThe Tree Containment problem has many important applications in the study of e...
We introduce a strong extended formulation of the convex recoloring prob- lem on a tree, which has a...
A coloring of a graph is convex if it induces a partition of the vertices into connected sub-graphs....
In this paper we prove that it is NP-complete to decide whether a graph can be partitioned into nont...
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a s...
AbstractGiven a family ofbinarycharacters defined on a setX, a problem arising in biological and lin...
We present an efficient algorithm that decides the consistency of partial descriptions of ordered t...
AbstractList partitions generalize list colourings. Sandwich problems generalize recognition problem...
The concept of convex extendability is introduced to answer the problem of finding the smallest dis...
AbstractA central problem that arises in evolutionary biology is that of displaying partitions of su...
A coloring of the leaves of a tree T is called convex, if it is possible to give each internal node ...
DOI
Add to ORKG