\myheading{Find maximal clique using MaxSAT solver}

\MathForProg has a short intro to graph cliques.

\renewcommand{\CURPATH}{MaxSxT/clique_openwbo}

Though not the most efficient method, but very spectacular and instructive.

In short: if there is no edge between a pair of vertices,
these two vertices cannot be included in the solution simultaneously.

Given the 50-vertices graph: \url{\RepoURL/\CURPATH/edges.txt}.

\lstinputlisting[style=custompy,basicstyle=\ttfamily\footnotesize]{\CURPATH/1.py}

Run:

\begin{lstlisting}
python3 1.py edges.txt
\end{lstlisting}

The resulting \ac{WCNF} file:

\lstinputlisting[style=customsat]{\CURPATH/sample.wcnf}

And the (correct) result, however, not the single one:

\lstinputlisting{\CURPATH/r.txt}

Further reading:
\url{https://cs.stackexchange.com/questions/70531/reduction-3sat-and-clique}.

