Subgraph Counting with Local Node Differential Privacy
Researchers give an optimal local node DP algorithm for counting constant-size subgraphs.
Stories per day · 30 days
1 stories, newest first · one card per story
1 stories, newest first · one card per story
Researchers give an optimal local node DP algorithm for counting constant-size subgraphs.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views