[Networkit] new diameter algorithm - benchmark
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...
Size: 495 bytes
Desc: Message signed with OpenPGP using GPGMail
More information about the NetworKit