您要查找的是不是：
- First the problem was modeled as an instance of vertex cover problem which was an NP-Complete problem. 先把该问题归结为图的顶点覆盖问题，它是一个NP完全问题；
- Hybrid genetic algorithm for vertex cover problem 一种求解顶点覆盖问题的混合遗传算法
- This paper presents the modeling process of the key covering problem(KCP) in the group rekeying and the transformations between the KCP and the vertex covering problem(VCP) in the graph theory. 本文给出了密钥覆盖问题模型的建立过程,首次给出密钥覆盖问题(KCP)与顶点覆盖问题(VCP)的相互变换。
- DNA algorithm for minimum vertex cover problem based on molecular computation 最小顶点覆盖问题的DNA分子算法
- vertex cover problem 顶点覆盖问题
- minimum vertex cover problem 最小顶点覆盖问题
- A DNA Solution on Surface for Minimal Vertex Covering Problems of Graph 图的最小顶点覆盖问题的面上DNA解法
- vertex covering problem 顶点覆盖问题
- A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper, which can be used for monitor-nodes selection in net traffic measurement. 摘要提出了一种分布式求解弱顶点覆盖集的近似算法，用于网络流量有效测量点的选择。
- The terminal path cover problem is to find a terminal path cover of G of minimum cardinality with respect to T. 终端路迳覆盖问题在于找到一个相对于T的G上最少路迳数的终端路迳覆盖。
- Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set in a Bipartite Graph. 二分图的最小点权覆盖集与最大点权独立集。
- Improvement on Vertex Cover and Independent Set Problem for Low-Degree Graphs 低度图的点覆盖和独立集问题下界改进
- The front cover of the novel has been torn off. 这本小说的封面已被撕掉。
- In order to resolve the minimal set covering problem availably, the sticker model of DNA computation based on sticking operations is introduced. 摘要运用DNA计算模式中基于粘贴运算的粘贴模型求解最小集合覆盖问题。
- You can't judge a book by its cover. 不能根据封面判断一本书(不可以貌取人)
- We used the well-known set covering problem (SCP) to model the vehicle routing problem and developed a Lagrangian relaxation based heuristics. 本研究将车辆路线问题转以集合涵盖问题描述，再以常用之拉氏松弛法为基础，结合变数产生法之观念来设计一启发式演算法。
- An Efficient Algorithm for Constraint Bipartite Vertex Cover 二分图约束的顶点覆盖问题的快速算法
- I look at this problem from a different viewpoint. 我从不同的观点来看这个问题。
- Constrained minimum vertex cover in bipartite graphs 二分图的受约束最小点覆盖
- Han, A. F. (1994), "Hybrid Heuristic Methods for Set Covering Problem," paper presented at the TIMS/ORSA Joint National Meeting, Boston, USA, April 24-27, 1994. 韩复华;游进俊(1993);"静态拨召服务问题启发式解法之研究;"中华民国运输学会第八届学术论文研讨会论文集;473至480页;民国82年12月.
