Social network analysis

Finding possible maximal cliques in a given graph is one of the basic problems of graph theory. Although the enumeration of maximal cliques in a graph is an NP-hard problem, various algorithms and novel methods for this problem have been proposed. In some application's largest possible maximal cliques i.e. maximum cliques play an important role. This study proposes a new algorithm that finds maximum cliques in a graph. The proposed algorithm is applied to different real-world datasets to find them. Moreover, this study proposes two versions of the algorithm; one finds all possible maximum cliques, and the other finds only one maximum clique in a given graph. To evaluate the performance, the results of the proposed study are compared with the well-known Born Kerbosch algorithm. As a result, it is found that the proposed algorithm performs better than the Born Kerbosch method.