Skip to content

Genetic Algorithm for the Maximum Clique Problem
Compare
Choose a tag to compare
@shah314 shah314 released this 21 Jul 17:08
· 54 commits to master since this release
v1.5
20f0b0c
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Verified
Learn about vigilant mode.

(Removed some unused code) (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.

Assets 2
Loading