1 citations · 1 across the 13 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers
Chenglin Fan, Jingcheng Liu, Pan Peng +2
We study the problem of releasing a synthetic graph that approximates the sizes of all cuts of an input graph under edge-level differential privacy. If one insists on purely additi…
cs.DS2025
A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances
Michael Dinitz, Chenglin Fan, Jingcheng Liu +2
We study the problem of approximating all-pair distances in a weighted undirected graph with differential privacy, introduced by Sealfon [Sea16]. Given a publicly known undirected…
cs.DS2023
Faster Algorithms for Generalized Mean Densest Subgraph Problem
Chenglin Fan, Ping Li, Hanyu Peng
The densest subgraph of a large graph usually refers to some subgraph with the highest average degree, which has been extended to the family of -means dense subgraph objectives…