vertex cover 中文意思是什麼
vertex cover
解釋
點覆蓋-
But the classical vertex cover algorithm can not use in the cbvc problem directly, because the cbvc problem have more term need to constraint
但是，以上的演算法並不能直接應用於受二分圖約束的頂點覆蓋問題（ constraintbipartitevertexcover ， cbvc ）求解。 -
Also with the help of graph rewriting, a new decision selection algorithm is proposed. this algorithm takes advantage of the weighted vertex cover algorithm, finds the vertexes with different color, and puts the minimum one into the group of chosen by sequence
同時，利用圖重寫規則實現了一個決策選擇演算法:採用圖的最小頂點覆蓋集合的演算法，首先通過圖著色找出著色相異的頂點，依次將可以使系統效益最大化的決策點加入到決策集合中。 -
The simulation results show that the novel algorithm is more scalable than the traditional algorithms, and can find smaller weak vertex cover
模擬結果表明，比較現有演算法，新演算法能找出更小的弱頂點覆蓋集，具有更好的可擴展性。 -
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
摘要提出了一種分散式求解弱頂點覆蓋集的近似演算法，用於網路流量有效測量點的選擇。 -
But this algorithm do not guarantee the minimization of the set of vertex cover, which mean while do not guarantee it can be fixed that all of fault chips which should be fixed
但該演算法的缺點在於不能保證求出頂點覆蓋的最優解。也就是說，當一片晶元在事實上是可修復時卻有可能在近似演算法中得到不可修復的結論。 -
This problem was first studied by n. hasan and c. l. liu in [ 5 ], and get some useable result : this problem can be solved as a constraint bipartite vertex cover ( cbvc ) problem. hasan and liu proposed two algorithms that solves the cbvc problem
另外， kuo和fuchs還對如何修復給出了兩個演算法：一個是近似演算法，到目前為止，該演算法仍然是最高效的頂點覆蓋問題的求解演算法之一。 -
As applications of succeeding, numerical examples of max - cut and vertex cover are given
數值實驗表明這種演算法是求解較大規模半定規劃問題的有效方法 -
Che [ 1 ] proposed a heuristic fault spectrum algorithm that solves the cbvc problem very efficient but still not guarantee the minimization of the set of vertex cover
Che在此前也曾提出過一種基於啟發式的錯誤譜演算法[ 1 ] ，有效提高了求解的效率。但該演算法仍然存在不能保證最優解的問題。
分享友人