Prerequisite: NP-Completeness, Clique problem. A clique in a graph is a set of vertices where each vertex shares an edge with every other vertex. Thus,… Read More »
The post Proof that Clique Decision problem is NP-Complete | Set 2 appeared first on GeeksforGeeks.
Proof that Clique Decision problem is NP-Complete | Set 2
![Proof that Clique Decision problem is NP-Complete | Set 2]()
Reviewed by Shoaib Khan
on
June 30, 2020
Rating:
No comments: