Weak-Order Extensions of an Order

dc.contributor.authorBertet, Karell
dc.contributor.authorGustedt, Jens
dc.contributor.authorMorvan, Michel
dc.date.accessioned2021-12-17T10:08:36Z
dc.date.available2021-12-17T10:08:36Z
dc.date.issued1997
dc.description.abstractIn 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.en
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15672
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14445
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherorderen
dc.subject.otherweak-order extensionsen
dc.subject.othergraphen
dc.subject.otheralgorithmen
dc.titleWeak-Order Extensions of an Orderen
dc.typeResearch Paperen
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfreeen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften>Inst. Mathematikde
tub.affiliation.facultyFak. 2 Mathematik und Naturwissenschaftende
tub.affiliation.instituteInst. Mathematikde
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber1997, 550en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
Files
Original bundle
Now showing 1 - 2 of 2
Loading…
Thumbnail Image
Name:
Report-550-1997.pdf
Size:
9.38 MB
Format:
Adobe Portable Document Format
Description:
Loading…
Thumbnail Image
Name:
Report-550-1997.ps
Size:
340.35 KB
Format:
Postscript Files
Description:
Collections