3) minimum vertex cover
最小顶点覆盖集
1.
An approximate algorithm for minimum vertex cover set of a graph;
求图的最小顶点覆盖集的一个近似算法
4) minimum weak vertex cover
最小弱顶点覆盖
1.
Maximum Independent Set and Minimum Weak Vertex Cover Problem Solving and Application;
最大独立集和最小弱顶点覆盖问题求解及其应用研究
5) Min-VC
最小点覆盖问题
1.
The Parameterized Vertex Cover Problem (short as PVC or VC) and the Minimum Vertex Cover Problem (short as Min-VC) are two important NP-hard problems.
参数化点覆盖问题(the Parameterized Vertex Cover Problem，简称PVC或VC)和最小点覆盖问题(the Minimum Vertex Cover Problem，简称Min-VC)是重要的NP难问题，研究人员对其算法包括参数化点覆盖问题的核心化算法做了大量的研究。
6) minimum coverage
最小覆盖
1.
There is a NP-hard problem that derive the minimum coverage of multi-output logic circuit in two-level logic synthesis.
两级逻辑综合中的多输出逻辑电路最小覆盖的求解是一个NP难解问题,在输出变量集合和质蕴含项集合规模较大的情况下,会出现空间需求过大、处理时间太长等问题,影响多输出最小覆盖求解的可行性。
2.
A minimum coverage method called CWSCM is presented to deal with complicated Web service composition.
针对复杂Web服务的组合问题,提出了基于最小覆盖的Web服务组合方法(CWSCM)。
3.
A new classifying discrimination method different from the previous ones was put forward based on the principle of minimum coverage.
提出了通过最小覆盖的原理来进行样本分类判别的一种新方法;给出了空间中的样本分类判别准则和分类模型。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条