ResearchTrend.AI
Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!

Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!

R. Jin
Zhen Peng
W. Wu
F. Dragan
G. Agrawal
Bin Ren
ArXiv (abs)PDFHTML

Papers citing "Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!"

4 / 4 papers shown
Title
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations
Maciej Besta
Michal Podstawski
Linus Groner
Edgar Solomonik
Torsten Hoefler
51
138
0
30 Oct 2020
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala
G. Blelloch
Julian Shun
GNN
67
147
0
14 May 2018
Gunrock: A High-Performance Graph Processing Library on the GPU
Gunrock: A High-Performance Graph Processing Library on the GPU
Yangzihao Wang
Andrew A. Davidson
Yuechao Pan
Yuduo Wu
Andy T. Riffel
John Douglas Owens
68
525
0
22 Jan 2015
GraphLab: A New Framework For Parallel Machine Learning
GraphLab: A New Framework For Parallel Machine Learning
Yucheng Low
Joseph E. Gonzalez
Aapo Kyrola
Danny Bickson
Carlos Guestrin
J. M. Hellerstein
60
908
0
09 Aug 2014