The following pages link to Dense subgraphs in random graphs (Q1741497):
Displaying 4 items.
- Sparse high-dimensional linear regression. Estimating squared error and a phase transition (Q2131259) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Testing correlation of unlabeled random graphs (Q6109918) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)
