Maximal Clique Sets with Pseudo Clique Constraints

Abstract

Many variants of pseudo-cliques have been introduced as a relaxation model of cliques to detect communities in real world networks. For most types of pseudo-cliques, enumeration algorithms can be designed just similar to maximal clique enumerator. However, the problem of enumerating pseudo-cliques is computational hard, because the number of maximal pseudo-cliques-cliques is huge in general. Furthermore, because of the weak requirement of k-plex, sparse communities are also allowed depending on the parameter k. To obtain a class of more dense pseudo cliques and to improve the computational performance, we introdue a derived graph whose vertices are cliques in the original input graph. Then our target pseudo must be a clique or a pseudo clique of the derived graph under an additional constraint requiring density in the original graph. An enumerator for this new class is designed and its computational efficientcy is experimentally verfied.