Loading...

Differentially private all-pairs shortest distances for low tree-width graphs

Ebrahimi, J. B ; Sharif University of Technology | 2023

0 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ISNCC58260.2023.10323834
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2023
  4. Abstract:
  5. In this paper, we present a polynomial time algorithm for the problem of differentially private all pair shortest distances over the class of low tree-width graphs. Our result generalizes the result of Sealfon [10] for the case of trees to a much larger family of graphs. Furthermore, if we restrict to the class of low tree-width graphs, the additive error of our algorithm is significantly smaller than that of the best known algorithm for this problem, proposed by Chen et. al. in [3]. © 2023 IEEE
  6. Keywords:
  7. Algorithms ; Differential privacy ; Graph theory ; Shortest path ; Tree-width
  8. Source: 2023 International Symposium on Networks, Computers and Communications, ISNCC 2023 ; 2023 ; 979-835033559-0 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/10323834