Login / Signup
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs.
Matteo Ceccarello
Andrea Pietracaprina
Geppino Pucci
Eli Upfal
Published in:
IPDPS (2016)
Keyphrases
</>
parallel algorithm
weighted graph
dominant points
parallel computation
shortest path
shared memory
cluster of workstations
discrete data
regularization framework
graph connectivity
parallel programming
parallel version
spanning tree
bayesian networks
edge weights
data objects
binary search trees
denoising