摘要
称一有限序集是一Greedy序集是指,它的每个关于碰撞数问题的Greedy线性扩张都是最优的。本文给出了Greedy序集的结构。
A finite ordered set is called as a greedy ordered set if each of its greedy linear extensions with respect to bump number problem is optimal. In this paper, it is given the structures of greedy ordered sets
出处
《苏州大学学报（自然科学版）》
CAS
1990年第3期282-289,共8页
Journal of Soochow University(Natural Science Edition)
关键词
序集
碰撞数
Greedy算法
线性扩张
ordered set, linear extension, bump numder, heuristic, greedy algorithm.
