๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Greedy linear extensions to minimize jumps

โœ Scribed by M.H. El-Zahar; I. Rival

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
646 KB
Volume
11
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Greedy linear extensions with constraint
Greedy linear extensions with constraints
โœ Ivan Rival; Nejib Zaguia ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 762 KB

Loosely speaking, a greedy linear extension of an ordered set is a linear extension obtained by following the rule: "climb as high as you can". Given an ordered set P and a partial extension P' of P is there a greedy linear extension of P which satisfies all of the inequalities of P'? We consider sp

Constructing greedy linear extensions by
Constructing greedy linear extensions by interchanging chains
โœ Ivan Rival; Nejib Zaguia ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 656 KB

A natural way to prove that a particular linear extension of an ordered set is 'optimal' with respect to the 'jump number' is to transform this linear extension 'canonically' into one that is 'optimal'. We treat a 'greedy chain interchange' transformation which has applications to ordered sets for w