Posets with seven linear extensions sortable by three comparisons
Highlights
► Partially sorted configurations can be represented by posets. ► Three comparisons are shown enough to sort posets with seven linear extensions. ► Our result has been open for seven years. ► The result can be applied to compute the minimum number of comparisons in sorting.
References (8)
The Ford–Johnson algorithm still unbeaten for less than 47 elements
Information Processing Letters
(2007)- et al.
Counting linear extensions
Order
(1991) - et al.
A tournament problem
American Mathematical Monthly
(1959) - et al.
Balancing poset extensions
Order
(1984)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.