Pan Peng
2 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.
This paper presents a polynomial-time differentially private algorithm for releasing a synthetic graph that approximates cut sizes in an input graph with error bound.
Papers
Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers
Chenglin Fan, Jingcheng Liu, Pan Peng, Hangyu Xu +1 more
This paper presents a polynomial-time differentially private algorithm for releasing a synthetic graph that approximates cut sizes in an input graph with error bound.