Clique Finding with SAT
A clique of a graph is a subset of its vertices that are all mutually connected. Finding a clique of a given size in a graph is a difficult problem in general.
In this worksheet we demonstrate how to solve the clique finding problem by translating it into Boolean logic and using Maple's built-in efficient SAT solver. This approach even can out-perform the built-in Maple function FindClique which also solves the clique finding problem.
