@techreport{Report-550-1997,
Title = {Weak-Order Extensions of an Order},
Author = {Bertet, Karell and Gustedt, Jens and Morvan, Michel},
Year = {1997},
Number = {550},
Note = {Appeared in Graph-Theoretic Concepts of Computer Science, WG'97, Rolf H. M\"ohring (Ed.), Lecture Notes in Computer Science 1335, p. 65-77},
Type = {Preprint},
Institution = {Technische Universit\"at Berlin, Institut f\"ur Mathematik},
Abstract = {In this paper, at first we describe a graph representing all the weak-order extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weak-order extensions of a partially ordered set, and implying a generation algorithm. 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.},
Url = {http://www.redaktion.tu-berlin.de/fileadmin/i26/download/AG_DiskAlg/FG_KombOptGraphAlg/preprints/1997/Report-550-1997.ps.gz}
}