Sciweavers

Share
1 search results - page 1 / 1
» Finding Dense Subgraphs in G(n,1 2)
Sort
View
CORR
2008
Springer
110views Education» more  CORR 2008»
10 years 4 months ago
Finding Dense Subgraphs in G(n,1/2)
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...
Atish Das Sarma, Amit Deshpande, Ravi Kannan
books