对于“集合的完全覆盖的求法”的改进  

An Improved Method to Obtain Complete Covering by Compatibility Relation Matrix

作　　者：田贺民[1] 朱丽梅[2] 

机构地区：[1]沈阳理工大学理学院,辽宁沈阳110159 [2]沈阳航空航天大学理学院,辽宁沈阳110136

出　　处：《沈阳理工大学学报》2012年第1期66-69,共4页Journal of Shenyang Ligong University

摘　　要：相容关系是集合中元素的一种重要的二元关系,与之一一对应的完全覆盖在计算机理论中有广泛的应用。原有的"利用相容关系矩阵求集合的完全覆盖"的方法中存在疏漏,研究提出了改进方案,并对新方法给出了证明与实例验证。Compatibility relation is a very important binary relation between elements of a set.For a given compatibility relation,it corresponds to one-to-one complete covering and complete covering is widely applied in computer theory.On the basis of analyzing and discussing the weakness of the original method that the complete covering of a set can be obtained by compatibility relation matrix,this dissertation gives an improved method,then the new method has been clearly demonstrated and one example of this is offered for verifying the new method.

关 键 词：相容关系 简化的相容关系矩阵 最大相容类 完全覆盖 

分 类 号：O157.5[理学—数学]