顶点覆盖 meaning in English
knotenueberdeckung vertex cover
Examples
- In this thesis , a polynomial function of exact cover to area minimization was given , and one case , k 3 , is discussed
本论文利用最小顶点覆盖问题规约到面积优化问题,只需讨论k 3一种情况,证明过程很简略。 - The simulation results show that the novel algorithm is more scalable than the traditional algorithms , and can find smaller weak 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 )求解。 - 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
但该算法的缺点在于不能保证求出顶点覆盖的最优解。也就是说，当一片芯片在事实上是可修复时却有可能在近似算法中得到不可修复的结论。