47 citations · 174 across the 37 of their papers we have counts for
3 papers · 1 filter
Differentially Private Densest Subgraph Detection
Dung Nguyen, Anil Vullikanti
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…
Fair Disaster Containment via Graph-Cut Problems
Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas +1
Graph cut problems are fundamental in Combinatorial Optimization, and are a central object of study in both theory and practice. Furthermore, the study of \emph{fairness} in Algori…
Parallel Algorithms for Densest Subgraph Discovery Using Shared Memory Model
B. D. M. De Zoysa, Y. A. M. M. A. Ali, M. D. I. Maduranga +3
The problem of finding dense components of a graph is a widely explored area in data analysis, with diverse applications in fields and branches of study including community mining,…