Massively Parallel Correlation Clustering in Bounded Arboricity Graphs

v1v2v3 (latest)

Massively Parallel Correlation Clustering in Bounded Arboricity Graphs

23 February 2021

Mélanie Cambus

ArXiv (abs)PDF HTML

Papers citing "Massively Parallel Correlation Clustering in Bounded Arboricity Graphs"

8 / 8 papers shown

Title
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds Nairen Cao Shang-En Huang Hsin-Hao Su 61 8 0 13 Jul 2023
Massively Parallel Algorithms for the Stochastic Block Model Zelin Li Pan Peng Xianbin Zhu 45 0 0 02 Jul 2023
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple! Sayak Chakrabarty K. Makarychev 81 16 0 23 May 2023
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs Michal Dory M. Ghaffari S. Ilchi 56 6 0 10 Jun 2022
$Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions$ Narrowing the LOCAL $\unicode{x2013}$ CONGEST Gaps in Sparse Networks via Expander Decompositions Yi-Jun Chang Hsin-Hao Su 92 10 0 17 May 2022
Almost 3-Approximate Correlation Clustering in Constant Rounds Soheil Behnezhad Moses Charikar Weiyun Ma Li-Yang Tan 57 28 0 07 May 2022
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions Sepehr Assadi Chen Wang 84 34 0 29 Sep 2021
Correlation Clustering in Constant Many Parallel Rounds Vincent Cohen-Addad Silvio Lattanzi Slobodan Mitrović A. Norouzi-Fard Nikos Parotsidis Jakub Tarnawski 44 43 0 15 Jun 2021