On the Decomposition of Posets

In this paper, we propose an efficient algorithm to decompose a partially ordered set S into a minimum set of chains. It requires only O (k×n2) time and space, where n is the num¬ber of the elements in S and k is the size of a maximum anti¬chain of S.