0 votes 0 votes How to find clique in a graph? Kanchan kumari asked Dec 16, 2018 Kanchan kumari 368 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shobhit Joshi commented Dec 16, 2018 reply Follow Share Clique decision problem is a NP-complete problem 0 votes 0 votes nishant_magarde commented Dec 16, 2018 reply Follow Share Is NP removed from the Gate Syllabus 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Check this one HeadShot answered Dec 16, 2018 HeadShot comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is complete. Ram Swaroop answered Dec 16, 2018 Ram Swaroop comment Share Follow See all 0 reply Please log in or register to add a comment.