On the generation of extensions of a partially ordered set

Citations of this article
Mendeley users who have this article in their library.

You may have access to this PDF.


A partially ordered set (or simply order) P is a set of elements E, together with a set R of relations of E, satisfying reflexivity, anti-symmetry and transitivity. The set E is called the ground set of P, while R is the relation set of it. There are many special orders. For example, when any two elements of E are related, the order is a chain. Similarly, we can define tree orders, forest orders and many others. An extension P’ of P is an order P’ having the same ground set as P, and such that its relation set contains R. When P’ is a chain then P’ is a linear extension of P. Similarly, when P’ is a forest then it is a forest extension of P. We consider the algorithmic problem of generating all extensions of a given order and also extensions of a special kind. The subject will be introduced by a general discussion on partially ordered sets.




Szwarcfiter, J. L. (2003). On the generation of extensions of a partially ordered set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2653, p. 3). Springer Verlag. https://doi.org/10.1007/3-540-44849-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free