Minimizing bumps in ordered sets by substitution decomposition (Q1122595)
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 4106912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing bumps in ordered sets by substitution decomposition |
scientific article; zbMATH DE number 4106912 |
Statements
Minimizing bumps in ordered sets by substitution decomposition (English)
0 references
1989
0 references
Consider a partially ordered set P of n elements. A linear extension \(x_ 1x_ 2...x_ n\) of P has a bump whenever \(x_ i<x_{i+1}\) in P. A decomposition theorem is presented for the problem of finding a linear extension of P with the minimal number of bumps.
0 references
autonomous subset
0 references
linear extension
0 references
minimal number of bumps
0 references
0.8658791184425354
0 references
0.8547013998031616
0 references
0.8331355452537537
0 references
0.8055678606033325
0 references
0.8014119863510132
0 references
