In this paper, we survey the approach for solving the maximum clique graph problem in the direction of metaheuristic algorithms and evaluate the quality of these research based on the experimental data system DIMACS. This survey can be useful for further research on maximum clique graph problems. |