5 citations · 5 across the 1 of their papers we have counts for
1 paper · 1 filter
Iden Kalemaj, Sofya Raskhodnikova, Adam Smith +1
We design the first node-differentially private algorithm for approximating the number of connected components in a graph. Given a database representing an n-vertex graph G and…