Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs

Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs

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 2016 for the case of trees to a much larger family of graphs. Furthermore, if we restrict...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-06
Hauptverfasser: Ebrahimi, Javad B, Alireza Tofighi Mohammadi, Kermani, Fatemeh
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Graphs
Polynomials
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 2016 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. 2023.
ISSN:2331-8422