Database Paper Browser

Back to papers

Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy

Summary: First differentially private, fully dynamic graph algorithms for triangle count, connected components, max matching, and degree histogram under continual edge updates. Bounds for event- and item-level DP; proves exponential dependence on time steps and, for item-level privacy, matches lower bounds for several problems. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1970
Venue
PODS
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,348 | 28.02%
DOI
10.1145/3725236

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers