[Networkit] Algorithms based on shortest path aggregation are *embarrassingly* parallel

Christian Staudt christian.staudt at kit.edu
Wed Sep 9 14:46:10 CEST 2015


Hi developers,
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:

centrality.ApproxBetweenness2
centrality.ApproxCloseness


So for those working on the subject, can you please parallelize these and future similar algorithms?

Best,
Chris



-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 495 bytes
Desc: Message signed with OpenPGP using GPGMail
URL: <https://lists.ira.uni-karlsruhe.de/mailman/private/networkit/attachments/20150909/9b180c8e/attachment.sig>


More information about the NetworKit mailing list