Weak-order extensions of an order

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 2003 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Bertet, K., Gustedt, J., & Morvan, M. (2003). Weak-order extensions of an order. Theoretical Computer Science, 304(1–3), 249–268. https://doi.org/10.1016/S0304-3975(03)00132-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free