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.
本文利用圖論中的頂點(diǎn)覆蓋算法和GIS中的網(wǎng)絡(luò)分析技術(shù),對(duì)非嵌入式傳感器在路網(wǎng)中的最優(yōu)定位問(wèn)題,即關(guān)鍵路口點(diǎn)的選擇問(wèn)題進(jìn)行了探討。
The fault coverage problem for reconfigurable arrays has received as constraint bipartite vertex cover problem, which is proved as a NP-complete.
對(duì)超大規(guī)模集成電路芯片 (VLSI)的缺陷修復(fù)可歸結(jié)為受二分圖約束的頂點(diǎn)覆蓋問(wèn)題 ,該問(wèn)題屬于NP完全問(wèn)題 。
The algorithm of this paper solved vertex cover problem from another point of view.
最優(yōu)頂點(diǎn)覆蓋問(wèn)題是6個(gè)基本的NP完全問(wèn)題之一,無(wú)法在多項(xiàng)式時(shí)間內(nèi)得到最優(yōu)解,除非P=NP。
Surface-based DNA algorithm for minimal vertex covering problem
圖的最小頂點(diǎn)覆蓋問(wèn)題的DNA表面計(jì)算模型
A VC algorithm to obtain the vertex covering of a graph is presented.
提出求一個(gè)圖的頂點(diǎn)覆蓋的 VC算法 ,定義圖的 VC表示式及其全閉鏈的概念。
This paper mainly studies two variants of the vertex covering problem.
本文主要研究了頂點(diǎn)覆蓋問(wèn)題的兩個(gè)變體問(wèn)題:一個(gè)是連接的頂點(diǎn)覆蓋問(wèn)題,二是含權(quán)的樹(shù)型頂點(diǎn)覆蓋問(wèn)題。
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.
考慮網(wǎng)絡(luò)節(jié)點(diǎn)的流守恒特性,網(wǎng)絡(luò)流量的有效監(jiān)測(cè)問(wèn)題可抽象為求給定圖G(V,E)的最小弱頂點(diǎn)覆蓋集的問(wèn)題和基于流劃分的最小弱頂點(diǎn)覆蓋集的問(wèn)題,這是NP難的問(wèn)題。
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.
提出了一種分布式求解弱頂點(diǎn)覆蓋集的近似算法,用于網(wǎng)絡(luò)流量有效測(cè)量點(diǎn)的選擇。
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).
把網(wǎng)絡(luò)流量的有效測(cè)量問(wèn)題抽象為求給定圖G=(V,E)的最小弱頂點(diǎn)覆蓋集的問(wèn)題。
Maximum Vertex Cover in Trees;
樹(shù)上的最大頂點(diǎn)覆蓋的算法設(shè)計(jì)和分析
A Hybrid Genetic Algorithm for Solving Minimum Vertices Covering Problem
一種求解圖最小頂點(diǎn)覆蓋問(wèn)題的混合遺傳算法
Surface-based DNA algorithm for minimal vertex covering problem
圖的最小頂點(diǎn)覆蓋問(wèn)題的DNA表面計(jì)算模型
Maximum Independent Set and Minimum Weak Vertex Cover Problem Solving and Application;
最大獨(dú)立集和最小弱頂點(diǎn)覆蓋問(wèn)題求解及其應(yīng)用研究
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.
提出了一種分布式求解弱頂點(diǎn)覆蓋集的近似算法，用于網(wǎng)絡(luò)流量有效測(cè)量點(diǎn)的選擇。
It covered every housetop,
雪花覆蓋了每一個(gè)屋頂，
White snows for ever rest on the mountain top.
皚皚積雪終年覆蓋山頂。
The tops of the mountains are covered with snow.
山頂上覆蓋著白雪。
To construct or supply with an arched ceiling;cover with a vault.
給…蓋拱頂給…建造或蓋以拱頂；以穹狀物覆蓋
The Parameterized Vertex Cover Problem and the Minimum Vertex Cover Problem;
參數(shù)化點(diǎn)覆蓋及最小點(diǎn)覆蓋問(wèn)題研究
Research of Substation Optimum Locating Based on Minimum Circle_Cover and Apex Weighted Voronoi Diagrams;
基于最小覆蓋圓及頂點(diǎn)加權(quán)V圖的變電站優(yōu)化選址研究
To form the crown, top, or chief ornament of.
加頂,覆蓋形成…的王冠、頂部或主要飾物
a shingled church spire
用屋頂板覆蓋的教堂尖頂.
Roof:Covering of the top of a Building.
屋頂:建筑物頂部覆蓋部分。
The transparent enclosure over the cockpit of an aircraft.
駕駛艙蓋，座艙蓋飛機(jī)駕駛室頂部的透明覆蓋物
cover or stain with slime.
為污點(diǎn)或粘液所覆蓋。
a structure that covers or forms the top of a building.
覆蓋或形成建筑物頂部的結(jié)構(gòu)。
bits of sweet chocolate used as a topping on e.g. ice cream.
覆蓋在冰淇淋頂上的少量甜巧克力。