76 search results - page 1 / 16 » Finding a Large Hidden Clique in a Random Graph |
SODA
1998
ACM
13 years 6 months ago
1998
ACM
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
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...
COMAD
2009
13 years 6 months ago
2009
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...