[Algorithms] 证明支配集问题是NP完全问题

声明：原题目出自《算法概论》，解答部分为原创 Problem ：   In an undirected graph G = (V, E), we say D ⊆ V is a dominating set if every v∈V is either in D or adjacent to at least one member of D. In the DOMINATING SET proble

>>阅读原文<<