图的最小顶点覆盖问题是图论中的一个NP完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
研究在双向网络中的最小充分集问题，并把他转化为最小顶点覆盖问题。
In this paper, the minimum sufficient set problem in bi-directed networks is studied.
最后我们利用粘贴模型的基本原理，运用荧光标记技术，提出了最小顶点覆盖问题的表面技术解决方案。
Finally, the solution of the minimal covering problem on surface using fluorescence marking technology is proposed based on the principle of sticker model.
该模型首先将问题解空间的DNA分子固定在固体载体上，然后通过进行相应的生化反应来求得图的最小顶点覆盖问题的所有解。
The DNA molecules of the solution space are fixed on the solid carrier, and then get the all solutions of minimal vertex covering problem by the biochemical actions.
网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。
The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.
网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。
The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.
应用推荐