1) set of covering representative vertices
覆盖表示顶点集
2) set of covering vertices
覆盖顶点集
3) minimum vertex cover
最小顶点覆盖集
1.
An approximate algorithm for minimum vertex cover set of a graph;
求图的最小顶点覆盖集的一个近似算法
4) minimal set of covering vertexes
极小覆盖顶点集
5) 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。
6) 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.
本文主要研究了顶点覆盖问题的两个变体问题:一个是连接的顶点覆盖问题,二是含权的树型顶点覆盖问题。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条