shah314/clique: Genetic Algorithm for the Maximum Clique Problem
| Main Author: | Shalin Shah |
|---|---|
| Format: | info software eJournal |
| Terbitan: |
, 2019
|
| Online Access: |
https://zenodo.org/record/3258851 |
Daftar Isi:
- 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.