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 ...