minimal covering number 最小覆盖数
minimal covering problem 最小顶点覆盖问题
the minimal covering set 最小覆盖集
totally-ordered minimal covering 全序最小覆盖
minimal vertex covering 极小点覆盖
minimal number of covering edges [数] 极小覆盖边数
minimal set of covering vertexes [数] 极小覆盖顶点集
minimal set of covering edges [数] 极小覆盖边集
minimal vertex-covering problem 最小顶点覆盖问题
Some simple separable function sets must be the component part of the minimal covering of precomplete classes in P*k.3.
2．证明了一类单纯可离函数集必须在部分多值逻辑中的极大封闭集的最小覆盖中出现。
参考来源 - 部分多值逻辑中Sheffer函数的判定In the fourth chapter, we proved the rest 16 classes sum to 32 of precomplete sets deducted from chapter 3 must among the minimal covering of precomplete sets in partial four-valued logic.
在第四章中,证明了第三章中未剔除的16类32个保三、四元的单纯可离函数集必在最小覆盖中出现,从而定出了部分四值逻辑准完备集之最小覆盖中所有保三、四元单纯可离关系的成员。
参考来源 - 部分四值逻辑中保三、四元单纯可离关系函数集最小覆盖之确定·2,447,543篇论文数据，部分数据来源于NoteExpress
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
Finally, the solution of the minimal covering problem on surface using fluorescence marking technology is proposed based on the principle of sticker model.
最后我们利用粘贴模型的基本原理，运用荧光标记技术，提出了最小顶点覆盖问题的表面技术解决方案。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
应用推荐