|
|||||
|
|
Constructing greedy linear extensions by interchanging chains |
|
| Authors: | Ivan Rival Nejib Zaguia |
| Institution: | (1) Department of Computer Science, University of Ottawa, 34 Somerset Street E., KIN 9B4 Ottawa, Canada;(2) Department of Mathematics, College of Science, P.O. Box 2455, 11451 Riyadh, Saudi Arabia |
| Abstract: | A natural way to prove that a particular linear extension of an ordered set is ‘optimal’ with respect to the ‘jump number’ is to transform this linear extension ‘canonically’ into one that is ‘optimal’. We treat a ‘greedy chain interchange’ transformation which has applications to ordered sets for which each ‘greedy’ linear extension is ‘optimal’. |
| Keywords: | Primary: 06A10 secondary: 68C25 |
| 本文献已被 SpringerLink 等数据库收录！ | |