图的最小顶点覆盖问题是图论中的一个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.
应用推荐