A genetic algorithms for solving the maximum clique problem using CUDA architecture

Jacek Widuch, Tomasz Franczyk


This work presents solving the Maximum Clique Problem (MCP) using CUDA architecture. Two genetic algorithms for solving MCP are proposed: the basic algorithm and the hybrid algorithm. Apart from that the results of experimental tests are presented.


maximum clique problem; CUDA architecture; genetic algorithm; hybrid algorithm

Full Text:

PDF (Polski)

DOI: http://dx.doi.org/10.21936/si2018_v39.n0.854