This project contains two exact algorithms (backtracking and branch-and-bound algorithms) for solving max clique problem. As future works I aim to develop an evolutionary algorithm in order to compare the performance of all these solutions.
This project is licensed under the MIT License - see the LICENSE file for details.