id: 01965399
dt: j
an: 01965399
au: Bertet, Karell; Gustedt, Jens; Morvan, Michel
ti: Weak-order extensions of an order.
so: Theor. Comput. Sci. 304, No. 1-3, 249-268 (2003).
py: 2003
pu: Elsevier Science Publishers, Amsterdam
la: EN
cc: 
ut: Partial order; Algorithm; Weak-order; Extension of an order; Graph;
    Complexity
ci: 
li: doi:10.1016/S0304-3975(03)00132-4
ab: Summary: At first we describe a digraph representing all the weak-order
    extensions of a partially ordered set and algorithms for generating
    them. Then we present a digraph representing all of the minimal
    weak-order extensions of a partially ordered set. This digraph also
    implies generation algorithms. Finally, we prove that the number of
    weak-order extensions of a partially ordered set is a comparability
    invariant, whereas the number of minimal weak-order extensions of a
    partially ordered set is not a comparability invariant.
rv: