专业词汇(按中图法分类)
1) minimum weak vertex cover
最小弱顶点覆盖
1.
Maximum Independent Set and Minimum Weak Vertex Cover Problem Solving and Application;
最大独立集和最小弱顶点覆盖问题求解及其应用研究
3) minimum vertex cover
最小顶点覆盖集
1.
An approximate algorithm for minimum vertex cover set of a graph;
求图的最小顶点覆盖集的一个近似算法
4) weak vertex cover
弱顶点覆盖
1.
Considering the equation of flow conservation, the problem of efficient monitoring is regarded as the problem of finding out the minimum weak vertex cover set and the minimum weak vertex cover set based on flow partition for a given graph G(V,E) which are all proved NP-Complete.
考虑网络节点的流守恒特性,网络流量的有效监测问题可抽象为求给定图G(V,E)的最小弱顶点覆盖集的问题和基于流划分的最小弱顶点覆盖集的问题,这是NP难的问题。
2.
A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper,which can be used for monitor-nodes selection in net traffic measurement.
提出了一种分布式求解弱顶点覆盖集的近似算法,用于网络流量有效测量点的选择。
3.
In this paper, the problem of efficient monitoring for the network flow is regarded as the problem to find out the minimum weak vertex cover set for a given graph G=(V,E).
把网络流量的有效测量问题抽象为求给定图G=(V,E)的最小弱顶点覆盖集的问题。
5) minimal covering problem
最小顶点覆盖问题
1.
A DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法 。
2.
Closed circle DNA algorithm of the minimal covering problem is put forward.
提出了闭环DNA计算模型的基本概念及其基本生化实验,并给出了解决最小顶点覆盖问题的闭环DNA算法。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条
