Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
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 prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
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 view...