mariamgui/CliqueSATSolver

This provides a SAT solver the graph cliaue problem which is NP-hard. A clique in a graph is a subset of vertices, all adjacent to each other, also called complete subgraphs in a graph.

Graph_Clique_SAT_Solver

This project provides a SAT solver for the graph clique problem which is an NP-hard problem.

What is a clique?

A clique in a graph is a subset of vertices, all adjacent to each other, also called complete subgraphs in the graph.

What you need to run this code?

Make sure to run export PYTHONPATH=$HOME/.smt_solvers/python_bindings

Then install pysmt with the z3 solver.

pysmt-install --z3

There exists many other solvers as well, and the choice of the solver is up to you.

To use clique solver on one data input please run Clique_solver_individual.py

The clique solver Clique_solver.py that has query as input is used to generate the plots (Make_plots.py)