1) slush covering
顶凌覆盖
2) whole plastic-film mulching in autumn and early spring
秋季(顶凌)全膜覆盖
3) roof
[英][ru:f] [美][ruf]
顶盖，覆盖
4) vertex cover
顶点覆盖
1.
By using the vertex cover algorithm in graph theory and network analysing techniques in GPS, the paper explores method in determining critical road network junctions for the optimum location of non-intrusive sensors for real-time traffic monitoring and data collection.
本文利用图论中的顶点覆盖算法和GIS中的网络分析技术,对非嵌入式传感器在路网中的最优定位问题,即关键路口点的选择问题进行了探讨。
2.
The fault coverage problem for reconfigurable arrays has received as constraint bipartite vertex cover problem, which is proved as a NP-complete.
对超大规模集成电路芯片 (VLSI)的缺陷修复可归结为受二分图约束的顶点覆盖问题 ,该问题属于NP完全问题 。
3.
The algorithm of this paper solved vertex cover problem from another point of view.
最优顶点覆盖问题是6个基本的NP完全问题之一,无法在多项式时间内得到最优解,除非P=NP。
5) vertex covering
顶点覆盖
1.
Surface-based DNA algorithm for minimal vertex covering problem
图的最小顶点覆盖问题的DNA表面计算模型
2.
A VC algorithm to obtain the vertex covering of a graph is presented.
提出求一个图的顶点覆盖的 VC算法 ,定义图的 VC表示式及其全闭链的概念。
3.
This paper mainly studies two variants of the vertex covering problem.
本文主要研究了顶点覆盖问题的两个变体问题:一个是连接的顶点覆盖问题,二是含权的树型顶点覆盖问题。
6) 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)的最小弱顶点覆盖集的问题。
补充资料：激凌凌
1.受惊吓而猛然抖动貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条