TU Berlin

FG Kombinatorische Optimierung und Graphenalgorithmen1997

COGA 5-Wheel

Inhalt

zur Navigation

Preprints 1997

Weak-Order Extensions of an Order
Zitatschlüssel Report-550-1997
Autor Bertet, Karell and Gustedt, Jens and Morvan, Michel
Jahr 1997
Nummer 550
Notiz Appeared in Graph-Theoretic Concepts of Computer Science, WG'97, Rolf H. Möhring (Ed.), Lecture Notes in Computer Science 1335, p. 65-77
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung 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.
Typ der Publikation Preprint
Link zur Publikation Download Bibtex Eintrag

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe