A local dense decision-making method for solving the maximum clique problem in large-scale undirected graphs

The maximum clique problem is a classic difficult problem. Most traditional solutions are branch and bound-based exact algorithms that perform well in terms of both accuracy and time at small legend sizes. However, in recent years, the scale of legend models in practical applications has expanded rapidly, and the traditional undirected graphical model solving methods are no longer applicable. At larger scales, a heuristic decision-making method for local density is proposed, a density index function is constructed, and a decision-making inference for finding maximum cliques is established. Our algorithm avoids random and disorderly traversal solutions, and it ensures the accuracy of the solution process. At the same time, a fast search threshold is added to the algorithm to improve the solution efficiency and local optimization ability. The experimental comparison shows that this algorithm and its improvements have better solution accuracy and solution time compared with the maximum clique accuracy algorithm.