摘要： 寻找极大团是几何图论极为重要的基础研究问题之一。将分辨函数模型与极大团性质结合,定义了顶点的极大团分辨函数、顶点关于某顶点子集的布尔映射函数,得到了一些与极大团相关的重要性质与定理,证明了图的极大团搜索问题可快捷自然地转换为相对简单的分辨函数表达式约束,为设计极大团搜索算法提供了一种有效的理论依据与求解途径。进而引入约简树构造方法设计了基于分辨函数的极大团搜索算法,最后通过给定无向连通图实例说明了算法的可行性与有效性。
| [1] 卢俊杰.几何图论中的若干问题[D].上海:上海交通大学,2009 [2] Cazalsa F,Karandeb C．A note on the problem of reporting maxi-mal cliques[J].Theoretical Computer Science,2008,407(3):564-568 [3] 李敏,王建新,刘彬彬,等．基于极大团扩展的蛋白质复合物识别算法[J].中南大学学报:自然科学版,2010,41(2):560-565 [4] Cheng J,Zhu L H,Ke Y P,et al．Fast Algorithms for Maximal Clique Enumeration with Limited Memory,2012[C]∥ACM SIGKDD International Conference on Knowledge Discovery and Data Mining．Beijing,2012:1240-1248 [5] Skowron A,Rauszer C．The discernibility matrices and functions in information systems[C]∥Intelligent Decision Support:Handbook of Applications and Advances to Rough Sets Theory．Dordrecht:Kluwer Academic Publishers,1992:331-362 [6] Skowron A,Pawlak Z．Rudiments of rough sets[J]．Information Sciences,2007,7(1):3-27 [7] Skowron A,Pawlak Z．Rough sets and Boolean reasoning[J].Information Sciences,2007,7(1):41-73 [8] 黄治国,孙伟,吴海涛．基于差别矩阵的约简树构造方法[J].计算机应用,2008,28(6):1457-1459 [9] Kryszkiewicz M．Comparative study of alternative types ofknowledge reduction in inconsistent systems[J]．International Journal of Intelligent Systems,2001,16(1):105-120 [10] 邓大勇,黄厚宽,李向军．不一致决策系统中约简之间的比较[J].电子学报,2007,35(2):252-255 [11] Miao D Q,Zhao Y,Yao Y Y,et al．Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model[J].Information Sciences,2009,179(24):4140-4150 [12] Zhou J,Miao D Q,Pedrycz W,et al．Analysis of alternative objective functions for attribute reduction in complete decision tables[J].Soft Computing,2011,15(8):1601-1616 [13] 陈星,林琼,薛颖,等．利用矩阵求极大相容类的一种方法[J]．后勤工程学院学报,2010,26(4):92-96 |
| No related articles found! |
|
||
首页