Anil Vullikanti

Differentially Private Densest Subgraph Detection

2021 · arXiv (Cornell University)

Densest subgraph detection is a fundamental graph mining problem, with a large number of applications. There has been a lot of work on efficient algorithms for finding the densest subgraph in massive networks. However, in …