A space-efficient parallel algorithm for computing betweenness centrality in distributed memory.
Nick EdmondsTorsten HoeflerAndrew LumsdainePublished in: HiPC (2010)
Keyphrases
- parallel algorithm
- shared memory
- space efficient
- distributed memory
- parallel computers
- data structure
- betweenness centrality
- parallel computation
- multiprocessor systems
- ibm sp
- parallel computing
- parallel programming
- data streams
- parallel machines
- sliding window
- complex networks
- parallel architectures
- parallel implementation
- bloom filter
- multithreading
- data sets
- b tree
- parallel version