[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

>>阅读原文<<