图的最小顶点覆盖问题是图论中的一个NP完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个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.
该模型首先将问题解空间的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.
应用推荐