1.1 Maximum Clique Problem Assume that the finite undirected simple graph is given, where V is the set of nodes, E is the set of edges. The arbitrary full graph is called a clique. The clique, which does not contain other cliques, is called a maximal Clique. The largest maximal clique is called a maximum clique. To extract all maximal cliques from the graph G. Many algorithms have...