maximum clique of a graph
[size,nodes] = max_clique(g,[ind])
integer (optional)
integer
integer row vector
max_clique
computes the maximum clique of the
graph g
i.e. the complete subgraph of maximum
size. ind
is a parameter for the choice of
the method: if ind
is 0 the method is a
partial enumerative algorithm and if ind
is 1
the algorithm is based on quadratic zero-one programming. The
default is 0. The output size
is the number
of the nodes of the clique found by the algorithm and
nodes
is the vector of the corresponding
nodes.