Published July 19, 2019
| Version v1.4
Software
Open
shah314/clique: Genetic Algorithm for the Maximum Clique Problem
Description
(Fixed a minor bug) Implementation of a genetic algorithm for the maximum clique problem in C++. A clique of a graph is a set of vertices in which each pair in the set have an edge between them i.e. it is a complete subgraph. A clique of maximum size is called the maximum clique. The algorithm uses new types of crossovers to achieve good results on several public graph datasets.
Files
shah314/clique-v1.4.zip
Files
(418.8 kB)
Name | Size | Download all |
---|---|---|
md5:f0f46457d513dab1a5b32da88d4700cb
|
418.8 kB | Preview Download |
Additional details
Related works
- Is supplement to
- https://github.com/shah314/clique/tree/v1.4 (URL)