✦ LIBER ✦

Super-Greedy Linear Extensions of Ordered Sets

✍ Scribed by H. A. KIERSTEAD; W. T. TROTTER

Book ID: 119863019
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 523 KB
Volume: 555
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb22460.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ordered Sets || Linear Extensions

✍ Rival, Ivan 📂 Article 📅 1982 🏛 Springer Netherlands ⚖ 667 KB

On some new types of greedy chains and g

On some new types of greedy chains and greedy linear extensions of partially ordered sets

✍ Maciej M. Syslo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 662 KB

NP-Completeness results concerning greed

NP-Completeness results concerning greedy and super greedy linear extensions

✍ Henry A. Kierstead 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 568 KB

On extensions, linear extensions, upsets

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

✍ Ricardo C. Corrêa; Jayme L. Szwarcfiter 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 303 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