摘要
讨论了可实现布尔矩阵的容度问题。将可实现布尔矩阵看成是无向图,我们证明了可实现布尔矩阵的容度等于其相应无向图的团覆盖数与孤立点数之和,并给出了通过计算容度来计算团覆盖数,以及通过计算团覆盖数来计算容度的算法框架。
This paper deals with the content problem for realizable Boolean matrices. Interpreting realizable Boolean matrices as undirected graphs, we show that the content of a realizable Boolean matrix is exactly the sum of the clique cover number and the number of isolated vertices of its corresponding undirected graph, and present algorithm frameworks to determine content through finding clique cover number, and to determine clique cover number through finding content.
出处
《模糊系统与数学》
CSCD
北大核心
2012年第5期118-124,共7页
Fuzzy Systems and Mathematics
基金
国家自然科学基金资助项目(11171242)
国家教育部博士点专项基金资助项目(20105134110002)
乐山师范学院科研项目(Z1117)
关键词
可实现布尔矩阵
容度
无向图
团覆盖
Realizable Boolean Matrix
Content
Undirected Graph
Clique Cover
