Maximal clique enumeration problem on graphs: status and challenges
绍显 许, 小飞 廖, 志远 邵, 强胜 华, 海 金 · Scientia Sinica Informationis · 2021
In the era of big data, graph mining has become a popular research topic. The maximal clique enumeration (MCE), as a basic problem in graph theory, has been widely used in different fields. However, considering the complexity of the MCE problem and the rapid growth in the scale of real-world graphs, enumerating the maximal cliques in real-world graphs is time-consuming. A large number of researches have been performed to improve the algorithm for the MCE problem and to reduce the execution time by applying various computational optimizations. For the MCE problem, this survey has conducted the following works: existing research works on the MCE problem are classified, the research status of the MCE problem is introduced in detail, and the challenges and future directions of the MCE problem are discussed.