Besides,we give DNA encoding methods and DNA algorithms for the 0/1 knapsack problem and the vertex cover problem.
此外,我们还给出了0/1背包问题和顶点覆盖问题的DNA编码方法和DNA算法。
参考来源 - 赋权图上优化问题的DNA计算方法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
图的最小顶点覆盖问题是图论中的一个NP完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
应用推荐