摘要
引进图的覆盖向量和独立向量概念,以向量和矩阵为工具,把图的最小覆盖和最大对立集问题转化为0-1规划问题,从而给出了寻找图的最小覆盖和最大独立集的一个方法.
We introduce the idea of Covering vector and Independent vector for a graph, and transfer the problems of a Minimum Covering and maximum Independent Set of a graph into 0 - 1 Programming problem, and then simple methods of finding a Minimum Covering and maximum Independent Set of a graph are given.
出处
《喀什师范学院学报》
2008年第3期21-22,共2页
Journal of Kashgar Teachers College
关键词
最小覆盖
最大独立集
0—1规划
Minimum covering set
Maximum independent set
0 - 1 Programming
