Search Results for author:
Found 1 papers, 0 papers with code
A Differentially Private Clustering Algorithm for Well-Clustered Graphs
We study differentially private (DP) algorithms for recovering clusters in well-clustered graphs, which are graphs whose vertex set can be partitioned into a small number of sets, each inducing a subgraph of high inner conductance and small outer conductance.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
