DBScholar

Back to papers

Node-Differentially Private Estimation of the Number of Connected Components

Summary: First poly-time node-DP algorithm to approximate the number of connected components with additive error Õ(Δ* ln ln n / ε), where Δ* is the minimum possible max-degree of a spanning forest. Uses efficient Lipschitz extensions via the forest polytope and a combinatorial no-Δ-star ⇒ Δ-bounded spanning-forest bound, yielding near-optimal l_∞ error on monotone graph families. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1922
Venue
PODS
Year
2023
Pagerank
5.093636e-05
Overall Rank
11,370 | 22.00%
DOI
10.1145/3584372.3588671

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{kalemaj_pods23,
        address = {New York, NY, USA},
        series = {{PODS} '23},
        title = {{Node-Differentially Private Estimation of the Number of Connected Components}},
        url = {https://dl.acm.org/doi/10.1145/3584372.3588671},
        doi = {10.1145/3584372.3588671},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kalemaj, Iden and Raskhodnikova, Sofya and Smith, Adam and Tsourakakis, Charalampos E.},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,826 Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy 2025 PODS 5.7621757e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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