vertex cover

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中的網絡分析技術,對非嵌入式傳感器在路網中的最優定位問題,即關鍵路口點的選擇問題進行了探討。

The fault coverage problem for reconfigurable arrays has received as constraint bipartite vertex cover problem, which is proved as a NP-complete.

對超大規模集成電路芯片 (VLSI)的缺陷修復可歸結為受二分圖約束的[頂]點覆蓋問題 ,該問題屬于NP完全問題 。

The algorithm of this paper solved vertex cover problem from another point of view.

最優[頂]點覆蓋問題是6個基本的NP完全問題之一,無法在多項式時間內得到最優解,除非P=NP。

A VC algorithm to obtain the vertex covering of a graph is presented.

提出求一個圖的[頂]點覆蓋的 VC算法 ,定義圖的 VC表示式及其全閉鏈的概念。

This paper mainly studies two variants of the vertex covering problem.

本文主要研究了[頂]點覆蓋問題的兩個變體問題:一個是連接的[頂]點覆蓋問題,二是含權的樹型[頂]點覆蓋問題。

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難的問題。

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.

提出了一種分布式求解弱[頂]點覆蓋集的近似算法,用于網絡流量有效測量點的選擇。

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)的最小弱[頂]點覆蓋集的問題。

An approximate algorithm for minimum vertex cover set of a graph;

求圖的最小[頂]點覆蓋集的一個近似算法

This paper presents the modeling process of the key covering problem(KCP) in the group rekeying and the transformations between the KCP and the vertex covering problem(VCP) in the graph theory.

本文給出了密鑰覆蓋問題模型的建立過程,首次給出密鑰覆蓋問題(KCP)與[頂]點覆蓋問題(VCP)的相互變換。

Hybrid genetic algorithm for vertex cover problem;

一種求解[頂]點覆蓋問題的混合遺傳算法

DNA algorithm for minimum vertex cover problem based on molecular computation;

最小[頂]點覆蓋問題的DNA分子算法

This paper presents a DNA algorithm for the minimum vertex cover problem which is based on satisfiable solution space.

論文給出了基于可滿足解空間的最小[頂]點覆蓋問題的DNA算法,該算法直接生成可滿足解空間,無須在全體解空間中進行各種過濾過程。

A new approximate method is presented for max-vertex-cover problem,and its performance guarantee is analyzed.

給出了求解最大[頂]點覆蓋問題的一種近似算法,討論了它的性能保證,利用P ipage技術,為最大[頂]點覆蓋問題設計出了0。