您要查找的是不是：
- Improvement on Vertex Cover and Independent Set Problem for Low-Degree Graphs 低度图的点覆盖和独立集问题下界改进
- Edge Weighted Maximum Independent Set Problem and an Approximate Algorithm for it 边带权最大独立集问题及其近似算法
- Hybrid optimization algorithm for solving maximum independent set problems 基于混合优化算法的最大独立集问题求解
- maximum independent set problem 最大独立集
- independent set problem 独立集
- Each row represents an independent set of criteria. 其中每一行都代表一个独立的条件集。
- Three independent sets of shortcuts. 三个独立的两套捷径。
- Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set in a Bipartite Graph. 二分图的最小点权覆盖集与最大点权独立集。
- In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it. 本文主要考虑外平面图中的反馈点集并给出了一个求外平面图最小顶点赋权反馈点集的线性时间算法。
- A system that can uniquely represent any unit which can be composed from a linearly independent set of base units. 对于可以分解为一组线性无关的基础单位的单位可以惟一表示的系统。
- Finally, a new algorithm is proposed, which is based on dynamic programming and directed acyclic graph (DAG), to solve a Controllable Set Problem. 这一结论说明改进后的算法更适合于实际生物系统分析，因为生物系统中某一功能的实现所涉及的化学物质往往多达数百种。
- Based on root tree and Maximal Weighted Independent Set, EACT utilizes periodical rotation of cluster heads to balance the energy consumed by nodes. 算法引入了图论中极大权极大独立集和根树的概念，并借助簇头轮换机制均衡节点消耗。
- In this paper, we study the minimum-weight feedback vertex set problem in seriesparallel graphs and present a linear-time exact algorithm to solve it. 文章摘要: A feedback vertex set is a subset of vertices in a graph; whose deletion from the graph makes the resulting graph acyclic.
- 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]中的最大独立集算法和最小支配集算法的结论都是错误的，因而图论中独立支配集的求解问题并没有解决.
- On complementation, we obtain the list of all maximal independent sets of G. 取其补集，得到G的所有极大独立集。
- To that end, the Mono developers provide two independent sets of libraries. 最终,Mono开发人员提供了两套独立的库。
- In this paper, we study the undirected minimum-cardinality feedback vertex set problem in outer-planar graphs and present a polynomial time algorithm to solve it. 本文讨论外平面图的反馈点集并给出了一个求外平面图最小反馈点集的多项式时间算法。
- Using this condition ,the available algorithms about themaximal independent set in the bipartite and non-bipartite network aregiven. 研究表明，负包络图也是关于网络最大独立集的充要条件。
- By using the elementary row transformation in the controllable matrix, the input matrix is replaced by the maximally linear independent set of its column vectors. 该算法在可控性矩阵中将输入矩阵用其列向量的极大线性无关组代替,并使用矩阵的行初等变换;
- It is now our aim to set up a factory. 我们现在的目的是创办一座工厂。
