Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14445
For citation please use:
Main Title: Weak-Order Extensions of an Order
Author(s): Bertet, Karell
Gustedt, Jens
Morvan, Michel
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15672
http://dx.doi.org/10.14279/depositonce-14445
License: http://rightsstatements.org/vocab/InC/1.0/
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.
Subject(s): order
weak-order extensions
graph
algorithm
Issue Date: 1997
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 1997, 550
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-550-1997.pdf
Format: Adobe PDF | Size: 9.61 MB
DownloadShow Preview
Thumbnail
Report-550-1997.ps
Format: Postscript | Size: 340.35 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.