Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets
Practice

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice

24 September 2020

Soheil Behnezhad

Laxman Dhulipala

Hossein Esfandiari

Vahab Mirrokni

Papers citing "Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice"

5 / 5 papers shown

Title
NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization J. Qiu Yuxiao Dong Hao Ma Jun Yu Li Chi Wang Kuansan Wang Jie Tang 50 171 0 26 Jun 2019
Connected Components at Scale via Local Contractions Jakub Lacki Vahab Mirrokni Michał Włodarczyk 52 18 0 27 Jul 2018
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs Sepehr Assadi M. Bateni A. Bernstein Vahab Mirrokni Cliff Stein 43 123 0 08 Nov 2017
DeepWalk: Online Learning of Social Representations Bryan Perozzi Rami Al-Rfou Steven Skiena HAI 252 9,769 0 26 Mar 2014
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average G. Blelloch Jeremy T. Fineman Julian Shun 71 129 0 15 Feb 2012