A parallel, ant-based algorithm for the Maximum Clique problem.
-
Updated
Sep 3, 2023 - C++
A parallel, ant-based algorithm for the Maximum Clique problem.
An analysis of a NP-Complete Graph Colouring problem 3-Colourability and an approximate algorithm analysis that solves 3-COL.
Comprehensive analysis of the NP-Complete problem k-Clique
Add a description, image, and links to the npcomplete topic page so that developers can more easily learn about it.
To associate your repository with the npcomplete topic, visit your repo's landing page and select "manage topics."