Publications (33)
Near-Optimal Correlation Clustering with Privacy
Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi +4
Correlation clustering is a central problem in unsupervised learning, with applications spanning community detection, duplicate detection, automated labelling and many more. In the…
All-Pairs 2-Reachability in Time
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano +2
In the -reachability problem we are given a directed graph and we wish to determine if there are two (edge or vertex) disjoint paths from to , for a given pair of ver…
Correlation Clustering in Constant Many Parallel Rounds
Vincent Cohen-Addad, Silvio Lattanzi, Slobodan MitroviÄ +3
Correlation clustering is a central topic in unsupervised learning, with many applications in ML and data mining. In correlation clustering, one receives as input a signed graph an…
Fully Dynamic -Clustering with Fast Update Time and Small Recourse
Sayan Bhattacharya, MartÃn Costa, Naveen Garg +2
In the dynamic metric -median problem, we wish to maintain a set of centers in an input metric space that gets updated via point insertions/deletion…
Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality
Filipe Miguel Gonçalves de Almeida, CJ Carey, Hendrik Fichtenberger +8
Learning and constructing large-scale graphs has attracted attention in recent decades, resulting in a rich literature that introduced various systems, tools, and algorithms. Grale…
Strong Connectivity in Directed Graphs under Failures, with Application
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
In this paper, we investigate some basic connectivity problems in directed graphs (digraphs). Let be a digraph with edges and vertices, and let be the di…