𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Minimizing bumps in linear extensions of
✍ 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