1 search results - page 1 / 1 » Finding Dense Subgraphs in G(n,1 2) |
116
click to vote
CORR
2008
Springer
15 years 4 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...