Minimizing bumps for posets of width two (Q1114719)
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 4083687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing bumps for posets of width two |
scientific article; zbMATH DE number 4083687 |
Statements
Minimizing bumps for posets of width two (English)
0 references
1988
0 references
Let \(L=\{x_ 1<...<x_ n\}\) be a linear extension of a finite partially ordered set P. A pair \((x_ i,x_ i+1)\) forms a bump in L whenever \(x_ i<x_ i+1\) in P. The author gives an effective solution for the problem of finding a linear extension with a minimum number of bumps when the width of P is two.
0 references
linear extension of a finite partially ordered set
0 references
linear extension with a minimum number of bumps
0 references
0.8703542351722717
0 references
0.8658791184425354
0 references
0.8465299606323242
0 references
0.8307777047157288
0 references
0.824568510055542
0 references
