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完全问题。