根据这个结论，设计了一个新的连通支配集求解算法，实验表明，新算法较前人的算法有更好的性能。
A new CDS algorithm was designed on the basis of the analysis. Simulation results show that the algorithm possess better performance than others.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
应用推荐