摘要
Hasse图是偏序集关系图的一种简明而有效的表示。文章证明了偏序集的唯一盖住关系Cov(A)等价于两个关系的复合运算,从而可转化为两个矩阵的布尔乘积,给出了一个求盖住关系Cov(A)的有效算法,从而方便、快捷地生成偏序集的Hasse图,完善了有关Hasse图的理论及算法。
As a simple and effective representation of the graph of poset relation, Hasse Diagram contains sufficient information about the partial ordering,and it is more concise than the graph of relation.For the poset 〈A,R〉, it is proved that R-I_A-(R-I_A)~2 is cov(A),an efficient algorithm of evaluating cov(A) is introduced so as to obtain Hasse Diagram. The presented algorithm enriches the methods of Hasse Diagram.
出处
《合肥工业大学学报（自然科学版）》
CAS
CSCD
北大核心
2005年第3期334-336,共3页
Journal of Hefei University of Technology：Natural Science
基金
合肥工业大学科学发展研究基金资助项目(05057F)
关键词
Hasse图
偏序关系
关系图
偏序集
算法
Hasse Diagram
partial ordering relation
graph of relation
poset
algorithm
