Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2109.14528
Cited By
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions
29 September 2021
Sepehr Assadi
Chen Wang
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions"
10 / 10 papers shown
Title
Dynamic Correlation Clustering in Sublinear Update Time
Vincent Cohen-Addad
Silvio Lattanzi
Andreas Maggiori
Nikos Parotsidis
38
0
0
13 Jun 2024
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds
Nairen Cao
Shang-En Huang
Hsin-Hao Su
30
7
0
13 Jul 2023
Massively Parallel Algorithms for the Stochastic Block Model
Zelin Li
Pan Peng
Xianbin Zhu
26
0
0
02 Jul 2023
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!
Sayak Chakrabarty
K. Makarychev
21
15
0
23 May 2023
A Distributed Palette Sparsification Theorem
Maxime Flin
M. Ghaffari
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
MoE
20
7
0
16 Jan 2023
Four Algorithms for Correlation Clustering: A Survey
Jafar Jafarov
24
0
0
24 Aug 2022
Almost 3-Approximate Correlation Clustering in Constant Rounds
Soheil Behnezhad
Moses Charikar
Weiyun Ma
Li-Yang Tan
25
26
0
07 May 2022
Near-Optimal Correlation Clustering with Privacy
Vincent Cohen-Addad
Chenglin Fan
Silvio Lattanzi
Slobodan Mitrović
A. Norouzi-Fard
Nikos Parotsidis
Jakub Tarnawski
31
14
0
02 Mar 2022
Near-Optimal Distributed Degree+1 Coloring
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
Tigran Tonoyan
24
36
0
01 Dec 2021
Improved Graph Clustering
Yudong Chen
Sujay Sanghavi
Huan Xu
92
191
0
11 Oct 2012
1