The mathematical properties of maximum clique problems were analyzed, which can be used to put forward the design of a competitive decision algorithm. The time complexity of the algorithm was analyzed, and the result is O(n³). To assess the efficiency of the algorithm, it was applied to a set of benchmark problems in maximum clique problems. It turns that our algorithm clearly outperforms other heuristics for solving maximum clique problems, while obtaining better or comparable solutions.