NP-complete problems——8.20

題目描述 In an undiorected graph G=(V,E), we say D⊆V is a domainting set if every v∈V is either in D or adjacent to at least one member of D. In the DOMINATING SET problem, the input is a graph and a budg

>>阅读原文<<