Weak-order extensions of an order - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2003

Weak-order extensions of an order

Abstract

In this paper, 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.

Dates and versions

inria-00099565 , version 1 (26-09-2006)

Identifiers

Cite

Karell Bertet, Jens Gustedt, Michel Morvan. Weak-order extensions of an order. Theoretical Computer Science, 2003, 304 (1-3), pp.249-268. ⟨10.1016/0898-1221(96)00102-2⟩. ⟨inria-00099565⟩
67 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More