Ask
Login
0
1.1kviews
The Clique Problems
written 6.7 years ago by gravatar for teamques10 teamques10 ★ 70k
analysis of algorithms
ADD COMMENT EDIT
1 Answer
0
5views
written 6.7 years ago by gravatar for teamques10 teamques10 ★ 70k

In an undirected graph, a clique is a complete sub-graph of the given graph. Complete sub- graph means, all the vertices of this sub-graph is connected to all other vertices of this sub- graph.

The Max-Clique problem is the computational problem of finding maximum clique of the graph. Max clique …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.