作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2004, Vol. 30 ›› Issue (07): 80-.

• 论文 • 上一篇    下一篇

冲突关系与相容关系之间的关系及其相关算法

吴陈,杨静宇,胡广朋,刘同明   

  1. 南京理工大学计算机科学与技术系,南京理工大学计算机科学与技术系,华东船舶工业学院计算机与通信工程系,华东船舶工业学院计算机与通信工程系 南京 210094;华东船舶工业学院计算机与通信工程系,镇江 212003
  • 发布日期:2004-04-15

Relationships Between Collision Relations and Compatible Relations and Relative Algorithm

WU Chen1,YANG Jingyu1,HU Guangpeng2,LIU Tongming2   

  1. (1. Dept. of Computer Science & Technology,Nanjing University of Science & Technology, Nanjing 210094; 2. Dept. of Computer & Communication Engineering, East China Shipbuilding Institute, Zhenjiang 212003)
  • Published:2004-04-15

摘要: 研究了冲突关系与相容关系的数学基础,对二者之间的关系以及按冲突关系进行的集合划分与相容关系的完全覆盖之间的关系进行了探讨。通过对按冲突关系进行集合划分方法的分析,设计了相应的3个算法。

关键词: 数据结构, 离散数学, 等价关系, 相容关系, 冲突关系

Abstract: The paper studies on the mathematical fundamentals of collision relations and compatible relations, explores the relationships between collision relations and compatible relations and the relationships between the set partitions according to a collision relation and the complete cover by a compatible relation. Through analyzing the set partition methods related to a collision relation, it designs three algorithms accordingly.

中图分类号: