A simple genetic algorithm for the maximum clique problem based on feasibility maintenance.
-
Updated
May 13, 2022 - Python
A simple genetic algorithm for the maximum clique problem based on feasibility maintenance.
Implementation of a state-of-the-art distributed algorithm for finding the maximal cliques in a graph
Add a description, image, and links to the maximal-cliques topic page so that developers can more easily learn about it.
To associate your repository with the maximal-cliques topic, visit your repo's landing page and select "manage topics."