独立集

最大独立集问题（MaximumIndependentSetproblem，MIS）是图论中经典的组合优化问题。

The maximum independent set problem is a classical problem in combinatorial optimization .

E不是一个独立集，并且任何子集X（？）C都是一个独立集，则称C为M的一个圈。

E is not an independent set and any X (?)

提出闭环DNA计算模型及其基本生化实验，给出解决最大独立集问题的闭环DNA算法。

An algorithm with closed circle DNA of the maximum independent set problem is put forward .

取其补集，得到G的所有极大独立集。

On complementation , we obtain the list of all maximal independent sets of G.

关于f因子的最小度与独立集条件的注记

Notes on conditions in terms of minimum degree and independent set for F _factors

被定义为G的一个极大独立集所含的最少点数。

Vi_v ( G ), where i_v ( G ) is the minimum cardinality of a maximal independent set that contains v.

首先将图的独立集问题转化为可满足性问题，然后利用本文改进的粘贴模型给出了图的最大独立集的DNA算法。

In this paper , the model was modified again and a modified DNA sticker model for maximum independent set of graph was built .

构造了一种用于最大独立集（MIS）问题求解的广义离散神经网络模型（GDHN）。

A generalized discrete neural network for solving maximal independent set ( MIS ) problem is designed .

研究了为保证一个图G是k－覆盖图，G所具有的独立集邻集的基数和最小度。

In this paper , we study the independent subsets neighbourhood and minimum degree of a graph G that guarantee G to be k-overed .

本文给出了一个有效的求任意简单图的最大团集（最大独立集，最小点覆盖）算法并给出了具体程序（用BASIC语言）。

In this article , an efficient algorithm is presented , which can find out a maximum clique ( or maximum independent set , minimum point covering ), and its computer programming ( with BASIC language ) is also given .

在第五章中把求解Ramsey数问题转化为求解最大团问题和最大独立集问题，然后利用DNA模型进行解决。

In chapter five the problem of solving the Ramsey number is transformated to DNA computing models to solve maximum clique and maximum independent set problems .

最后通过类比DNA编码问题和图的独立集问题，说明了求解最大DNA序列集合问题是NP完全的。

Finally , the paper carried on the analogy to DNA sequence design problem and graph independent set problem , and proved the maximum DNA sequences set problem was a NP complete problem .

本文利用已建立的拟阵代数结构和面环的Hilbert函数，给出了拟阵中独立集个数的几个不等式。

In this paper , we give some inequalities on the independent set numbers of a matroid , by using the Hilbert function of the matroid algebra .

最后对于算法的通信开销、频谱利用率和公平性性能进行了仿真与分析，极大独立集频谱分配算法与列表着色greedy算法和列表着色fair算法进行比较，仿真结果分析验证了该算法的性能。

At last , compared with List-coloring greedy algorithm and List-coloring fair algorithm , the emulation result shows MIS algorithm has better performance in communication cost , utilization and fairness of spectrum allocation .

该文基于Hopfield神经网络为模型，将阵列的重构问题转化为矛盾图的最大独立集问题。

It 's based on the model of Hopfield neural network , changing the problem of array reconfiguration into the problem of maximum independent set of contradiction graph .

本文应用Hopfield网络，系统地研究了图的最大团和最大独立集问题，通过建立相应的数学理论，改进了这方面已有的工作，并进行了模拟实验，给出了实验研究的结果。

On the basis of the Hopfield networks , this paper deals with the maximal clique and the maximal independent set of a graph by mathematical analysis of the problem , the improvements of the performance are illustrated with some simulation examples .

本文利用转移矩阵方法分别给出了某些图类的独立集多项式和一类六角系统的Clar覆盖多项式的转移矩阵表示。

The transfer-matrix expressions of the independent set polynomial and the Clar covering polynomial of some graphs are given here .

由BPEC算法产生的簇头集合被证明是一个最大独立集，簇头集合能覆盖网络的所有节点。

The cluster set generated by BPEC is proved to be a Maximum Independent Set , which can cover all network nodes .

文中利用图论中极大权独立集和根树的概念给出一种求簇树骨干网的EACT算法及对该骨干网的维护和更新算法。

Based on root tree and Maximal Weighted Independent Set , we propose the EACT ( Energy-Aware Clustering Tree ) algorithm and the maintenance and update algorithm of the cluster tree backbone network .

UD-TDMA算法将求解并发通信节点个数问题转化为求解极大独立集的理论问题，设计分布式算法获得每轮发送节点的极大独立集，进而确定节点时隙分配和发送周期。

UD-TDMA algorithm transforms the solution of the number of concurrent communication node into solving the theoretical issues of maximal independent set . It designs a distributed algorithm to obtain a maximal independent set of concurrent node and to determine the node slot distribution and the transmission cycle .

求图的最大独立集的启发式搜索算法

A heuristic search algorithm for finding maximun independent set of Graphs

基于极大独立集的协作竞价频谱分配算法

Cooperated Bidding Algorithm for Spectrum Allocation Based on Maximal Independent Set

超立方体的3－独立集及其在神经联想存储器中的应用

3-Independent Sets of Hypercubes and Applications in Neural Associative Memories

枚举图的全部极大独立集的普遍性方法

A General Method for Generating all Maximal Independent Sets of a Graph

本文提出了一种求图的最大独立集的新算法：启发式搜索算法。

A heuristic searching algorithm is presented in this paper .

无线网络中基于最高向量权独立集的分群算法

A clustering algorithm based on highest vector-weighted independent set in wireless network

弦图的最大权强独立集

Strongly independent set with maximum weight of a chordal graph

低度图的点覆盖和独立集问题下界改进

Improvement on Vertex Cover and Independent Set Problem for Low Degree Graphs

研究了模糊独立集系统的生成运算。

Construtive operations of fuzzy independence set systems are studied .

点独立集度和的几个结果

Some Results about Degree Sums of Independent Sets of Vertices