Solving the Maximal Clique Problem on Compressed Graphs.
ISMIS(2018)
摘要
The Maximal Clique Enumeration problem (MCE) is a graph problem encountered in many applications such as social network analysis and computational biology. However, this problem is difficult and requires exponential time. Consequently, appropriate solutions must be proposed in the case of massive graph databases. In this paper, we investigate and evaluate an approach that deals with this problem on a compressed version of the graphs. This approach is interesting because compression is a staple of massive data processing. We mainly show, through extensive experimentations, that besides reducing the size of the graphs, this approach enhances the efficiency of existing algorithms.
更多查看译文
关键词
Maximal clique enumeration, Graph compression, Modular decomposition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络