Almost 3-Approximate Correlation Clustering in Constant Rounds

7 May 2022

Papers citing "Almost 3-Approximate Correlation Clustering in Constant Rounds"

10 / 10 papers shown

Title
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions Sepehr Assadi Chen Wang 81 33 0 29 Sep 2021
Scalable Community Detection via Parallel Correlation Clustering Jessica Shi Laxman Dhulipala David Eisenstat Jakub Lacki Vahab Mirrokni 37 31 0 27 Jul 2021
Correlation Clustering in Constant Many Parallel Rounds Vincent Cohen-Addad Silvio Lattanzi Slobodan Mitrović A. Norouzi-Fard Nikos Parotsidis Jakub Tarnawski 42 42 0 15 Jun 2021
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs Mélanie Cambus Davin Choo Havu Miikonen Jara Uitto 41 15 0 23 Feb 2021
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 53 62 0 11 Jan 2019
Parallel Graph Connectivity in Log Diameter Rounds Alexandr Andoni C. Stein Zhao Song Zhengyu Wang Peilin Zhong 46 99 0 08 May 2018
Round Compression for Parallel Matching Algorithms A. Czumaj Jakub Lacki Aleksander Madry Slobodan Mitrovic Krzysztof Onak Piotr Sankowski 61 101 0 11 Jul 2017
Parallel Correlation Clustering on Big Graphs Xinghao Pan Dimitris Papailiopoulos Samet Oymak Benjamin Recht Kannan Ramchandran Michael I. Jordan 59 85 0 17 Jul 2015
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average G. Blelloch Jeremy T. Fineman Julian Shun 74 129 0 15 Feb 2012
Sorting, Searching, and Simulation in the MapReduce Framework M. Goodrich Nodari Sitchinava Qin Zhang 81 250 0 10 Jan 2011