[Networkit] new diameter algorithm - benchmark

Christian Staudt christian.staudt at kit.edu
Tue Feb 16 17:15:08 CET 2016

> On 16 Feb 2016, at 16:47, Michael Hamann <michael.hamann at kit.edu> wrote:
>> Result: For typical complex networks, they are basically equally fast.
>> SumSweep just has much better worst-case behavior, which means it will also
>> work on street-network like graphs.
> How do these running times deal with parallelization?

Default level of parallelism. iFub was parallel while your SumSweep is sequential, right?
-------------- 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/20160216/bc8622d9/attachment-0001.sig>

More information about the NetworKit mailing list