您要查找的是不是：
- On complementation, we obtain the list of all maximal independent sets of G. 取其补集，得到G的所有极大独立集。
- The Logical Algorithm of Maximal Independent Set 极大独立集的逻辑算法
- MIS (maximal independent set) 最大独立集
- Maximal Independent Set (MIS) 极大独立集
- The following results are proved : (1) Let L be transitive on V(G) and Abelian , then G has two disjoint maximal independent sets , and each contains a. vertices , (where a is the independence number of G) . 本文证明了下面的结果: 1.;设L在V(G)上可迁且为交换群;则G有两个不相交的极大独立点集。
- Maximal Independent Sets (MIS) 极大独立集
- The Logical and Recursive Algorithm of Maximal Independent Set and Minimal Covering Set 极大独立集与极小覆盖集的逻辑及递归算法
- Application of The Maximal Independent Sets in College Time-Table System 最大独立集在高校排课表系统中的应用
- On complementation, we obtain the list of all maximal independent sets of G 取其补集，得到G的所有极大独立集。
- maximal independent set 极大独立集
- Each row represents an independent set of criteria. 其中每一行都代表一个独立的条件集。
- Based on root tree and Maximal Weighted Independent Set, EACT utilizes periodical rotation of cluster heads to balance the energy consumed by nodes. 算法引入了图论中极大权极大独立集和根树的概念，并借助簇头轮换机制均衡节点消耗。
- maximal independent sets 最大独立集
- Three independent sets of shortcuts. 三个独立的两套捷径。
- maximal linearity independent set 极大线性无关组
- Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set in a Bipartite Graph. 二分图的最小点权覆盖集与最大点权独立集。
- maximal linearly independent set 极大线性无关组
- A system that can uniquely represent any unit which can be composed from a linearly independent set of base units. 对于可以分解为一组线性无关的基础单位的单位可以惟一表示的系统。
- This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [1] are wrong. 用反例证明了文[1]中的最大独立集算法和最小支配集算法的结论都是错误的，因而图论中独立支配集的求解问题并没有解决.
- Using this condition ,the available algorithms about themaximal independent set in the bipartite and non-bipartite network aregiven. 研究表明，负包络图也是关于网络最大独立集的充要条件。
