Constructing greedy linear extensions by interchanging chains (Q1087566): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ivan Rival / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Nicolae Tandareanu / rank | |||
Normal rank | |||
Revision as of 12:36, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing greedy linear extensions by interchanging chains |
scientific article |
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
