A two-stage Leiden+LLP ordering saves 0.3-5.4 bits per edge on poorly ordered graphs across encoders, while new BG/CS/CG encoders improve over BVGraph high-compression by 2-9%.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
The authors provide a systematization of differentially private graph release methods along with an objective-based framework and two illustrative evaluations for social network analysts.
citing papers explorer
-
Community-Aware Vertex Ordering for Reference-Based Graph Compression: A Cross-Encoder Empirical Study
A two-stage Leiden+LLP ordering saves 0.3-5.4 bits per edge on poorly ordered graphs across encoders, while new BG/CS/CG encoders improve over BVGraph high-compression by 2-9%.
-
SoK: Practical Aspects of Releasing Differentially Private Graphs
The authors provide a systematization of differentially private graph release methods along with an objective-based framework and two illustrative evaluations for social network analysts.