✦ LIBER ✦

On extensions, linear extensions, upsets and downsets of ordered sets

✍ Scribed by Ricardo C. Corrêa; Jayme L. Szwarcfiter

Book ID: 108113520
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 303 KB
Volume: 295
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.12.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Extensions, Linear Extensions, Upsets

On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract)

✍ Ricardo C. Corrâa; Jayme L. Szwarcfiter 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Super-Greedy Linear Extensions of Ordere

Super-Greedy Linear Extensions of Ordered Sets

✍ H. A. KIERSTEAD; W. T. TROTTER 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

On linear extensions of ordered sets wit

On linear extensions of ordered sets with a symmetry

✍ Bernhard Ganter; Gerhart Häfner; Werner Poguntke 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 238 KB

On Operations and Linear Extensions of W

On Operations and Linear Extensions of Well Partially Ordered Sets

✍ Maciej Malicki; Aleksander Rutkowski 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 116 KB

Proportional transitivity in linear exte

Proportional transitivity in linear extensions of ordered sets

✍ P.C Fishburn 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Minimizing bumps in linear extensions of

Minimizing bumps in linear extensions of ordered sets

✍ Peter C. Fishburn; William V. Gehrlein 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 650 KB

A linear extension x,x2xs ... of a partially ordered set (X, <) has a bump whenever xi < xi+l. We examine the problem of determining linear extensions with as few bumps as possible. Heuristic algorithms for approximate bump minimization are considered. AhfS (MOS) subject classifications (1980). Prim