Constructing greedy linear extensions by interchanging chains (Q1087566)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing greedy linear extensions by interchanging chains |
scientific article; zbMATH DE number 3987337
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing greedy linear extensions by interchanging chains |
scientific article; zbMATH DE number 3987337 |
Statements
Constructing greedy linear extensions by interchanging chains (English)
0 references
1986
0 references
The authors give the ''greedy chain interchange algorithm'' to obtain a greedy linear extension of an ordered set. An ordered set is greedy iff this algorithm does not increase the jump number. The role of some subdiagrams of a greedy ordered set is studied also.
0 references
greedy chain interchange algorithm
0 references
greedy linear extension
0 references
ordered set
0 references
jump number
0 references
0.8982501
0 references
0.87803113
0 references
0.85328454
0 references
0.85168487
0 references
0 references
0.8458627
0 references
0.84298795
0 references
0.8371516
0 references
