A New Genetic Algorithm for the Maximum Clique Problem
Artificial Intelligence and Applied Mathematics in Engineering ProblemsLecture Notes on Data Engineering and Communications Technologies(2020)
摘要
The Maximum Clique Problem is widely studied optimization problem and plays an essential part in computer science. In the literature, therefore, there are many exact and heuristic approaches and new strategies are continuously being proposed. In this paper, the maximum clique problem is studied, and a new hybrid genetic algorithm is proposed for finding the maximum clique in a graph. The proposed algorithm is tested on the DIMACS and BHOSLIB benchmark instances. The computational results are compared with similar literature researches. The results prove the effectiveness of proposed algorithm.
更多查看译文
关键词
Maximum clique problem, Graph theory, Optimization problems, Heuristic algorithms, Hybrid genetic algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要