Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4057574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II |
scientific article; zbMATH DE number 4057574 |
Statements
Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (English)
0 references
1987
0 references
arc diagrams of posets
0 references
jump number problem
0 references
N-free posets
0 references
greedy chains
0 references
0 references
0.8850542306900024
0 references
0.8780826926231384
0 references
0.858018696308136
0 references
