NP -Complete Problem. See Fig 36.11 for the proof roadmap. Def. A clique in an undirected graph G=(V, E) is a subset of vertices, each pair of which is ...
確定! 回上一頁