《算法概论》Ex8.14
《算法概论》Ex8.14
Prove that the following problem is NP-complete: given an undirected graph G=(V,E)G = (V,E) and an integer kk, return a clique of size kk as well as an independent set of size kk, provid
原创
2018-01-03 15:29:45 ·
352 阅读 ·
0 评论