\HeaderA{maxClique}{Find all the cliques in a graph}{maxClique}
\keyword{models}{maxClique}
\begin{Description}\relax
Find all the cliques in a graph
\end{Description}
\begin{Usage}
\begin{verbatim}
maxClique(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] an instance of the \code{graph} class 
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
Notice the maximum clique problem is NP-complete, which means it 
cannot be solved by any known polynomial algorithm.

We implemented the algorithm from:
Finding all cliques of an undirected graph, 
by C. Bron and J. Kerbosch, 
Communication of ACM, Sept 1973, Vol 16, No. 9.
\end{Details}
\begin{Value}
\begin{ldescription}
\item[\code{maxClique}] list of all cliques in \code{g}
\end{ldescription}
\end{Value}
\begin{Author}\relax
Li Long <li.long@isb-sib.ch>
\end{Author}
\begin{References}\relax
\end{References}
\begin{SeeAlso}\relax
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL"), open="r"))
maxClique(coex)
coex <- fromGXL(file(system.file("XML/hcs.gxl",package="RBGL"), open="r"))
maxClique(coex)
\end{ExampleCode}
\end{Examples}

