Releases: shah314/clique
Genetic Algorithm for the Maximum Clique Problem
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.
Genetic Algorithm for the Maximum Clique Problem
(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.
Genetic Algorithm for the Maximum Clique Problem
(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.
Genetic Algorithm for the Maximum Clique Problem
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.
Genetic Algorithm for the Maximum Clique Problem
A Genetic Algorithm Implementation of the Maximum Clique Problem. The algorithm is able to get good results on several public graph datasets. It uses some new crossover mechanisms to achieve these results.
Genetic Algorithm for the Maximum Clique Problem
A Genetic Algorithm Implementation of the Maximum Clique Problem. The algorithm is able to get good results on several public graph datasets. It uses some new crossover mechanisms to achieve these results.