1 code implementation • 3 Oct 2007 • Murali Krishna P, Sabu . M Thampi
A clique in an undirected graph G= (V, E) is a subset V' V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph.
Discrete Mathematics Computational Complexity
