New LEDP k-core and triangle-counting algorithms replace edge-count error bounds with degree- and degeneracy-based bounds, and are evaluated in a distributed simulation with reported accuracy improvements.
Title resolution pending
1 Pith paper cite this work, alongside 10 external citations. Polarity classification is still indexing.
1
Pith paper citing it
10
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Practical and Accurate Local Edge Differentially Private Graph Algorithms
New LEDP k-core and triangle-counting algorithms replace edge-count error bounds with degree- and degeneracy-based bounds, and are evaluated in a distributed simulation with reported accuracy improvements.