184 citations · 779 across the 55 of their papers we have counts for
1 paper · 2 filters
Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal
The planted densest subgraph detection problem refers to the task of testing whether in a given (random) graph there is a subgraph that is unusually dense. Specifically, we observe…