A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs.
Matteo CeccarelloAndrea PietracaprinaGeppino PucciEli UpfalPublished in: CoRR (2015)
Keyphrases
- parallel algorithm
- weighted graph
- dominant points
- parallel computation
- parallel programming
- cluster of workstations
- discrete data
- discovery of association rules
- edge weights
- shortest path
- spanning tree
- binary search trees
- parallel implementations
- medial axis transform
- shared memory
- regularization framework
- parallel version
- graph structure
- pairwise
- graph connectivity
- processor array
- random walk