[Networkit] Algorithms based on shortest path aggregation are *embarrassingly* parallel
christian.staudt at kit.edu
Wed Sep 9 14:46:10 CEST 2015
centrality measures based on shortest paths (like betweenness, closeness etc.) are relevant, but also expensive to compute. Doing many traversals of a large graph takes long, but parallelizing them and aggregating the results is probably easy.
The following algorithms are currently not parallel:
So for those working on the subject, can you please parallelize these and future similar algorithms?
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 495 bytes
Desc: Message signed with OpenPGP using GPGMail
More information about the NetworKit