Faster approximate subgraph counts with privacy

Dung Nguyen, M. Halappanavar, Venkatesh Srinivasan, Anil Vullikanti
2/12/2026

No confident code implementation found for this paper.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{nguyen2026faster,
  title  = {Faster approximate subgraph counts with privacy},
  author = {Dung Nguyen and M. Halappanavar and Venkatesh Srinivasan and Anil Vullikanti},
  year   = {2026},
  doi    = {10.52202/075280-3085},
  url    = {https://doi.org/10.52202/075280-3085},
  journal = {NEURIPS 2023 2023}
}

Discussion