Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs

Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya

We propose an algorithm for counting the number of cycles under local differential privacy for degeneracy-bounded input graphs. Numerous studies have focused on counting the number…