Finding maximal cliques in massive networks by H*-graph

Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The problem is extensively studied; however, the best existing algorithms require memory space linear in the size of the input graph. This has become a serious concern in view of the massive volume of today’s fastgrowing network graphs. Since MCE requires random access to different parts of a large graph, it is difficult to divide the graph into smaller parts and process one part at a time, because either the result may be incorrect and incomplete, or it incurs huge cost on merging the results from different parts. We propose a novel notion, H∗ -graph, which defines the core of a network and extends to encompass the neighborhood of the core for MCE computation. We propose the first external-memory algorithm for MCE (ExtMCE) that uses the H∗ -graph to bound the memory usage. We prove both the correctness and ...

• Type: Conference
• Year: 2010
• Where: SIGMOD
• Authors: James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu
• Keywords: Algorithms Require Memory, Database, Maximal Clique Enumeration, Maximal Cliques, SIGMOD 2010