Large Maximal Cliques Enumeration in Large Sparse Graphs

Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be viewed as a clique in the graph representing the social network. In several real life situations, finding small cliques may not be interesting as they are large in number and low in information content. Hence, in this paper, we propose a variant of maximal clique enumeration problem where we try to enumerate only large maximal cliques. We describe a novel preprocessing technique to reduce the graph size before enumerating the large maximal cliques. This is of great practical interest since enumerating maximal cliques is a computationally hard problem and the execution time increases rapidly with the input size. We also present a new maximal clique enumeration algorithm SELMaC2, which exploits the constraint on minimum size of the desired maximal cliques. We present experimental results on several real life social...

• Type: Conference
• Year: 2009
• Where: COMAD
• Authors: Natwar Modani, Kuntal Dey
• Keywords: COMAD 2008, COMAD 2009, Large Maximal Cliques, Maximal Clique Enumeration, Maximal Cliques