Differentially Private Gomory-Hu Trees

Given an undirected, weighted $n$-vertex graph $G = (V, E, w)$, a Gomory-Hu tree $T$ is a weighted tree on $V$ such that for any pair of distinct vertices $s, t \in V$, the Min-$s$-$t$-Cut on $T$ is also a Min-$s$-$t$-Cut on $G$. Computing a Gomory-Hu tree is a well-studied problem in graph algorith...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Aamand, Anders, Chen, Justin Y, Dalirrooyfard, Mina, Mitrović, Slobodan, Nevmyvaka, Yuriy, Silwal, Sandeep, Xu, Yinzhan
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Cryptography and Security Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!