[Networkit] Centrality Betweenness algorithms
meyerhenke at kit.edu
Fri May 23 09:10:26 CEST 2014
Thanks for the pointer. Yes, we know the paper and use certain, but not
all ideas it proposes.
Have you made a comparison of running times for your graphs? I would be
very curious about that, even an informal one.
Am 22.05.14 20:26, schrieb Lars Beckmann:
> we tried another package to compute betweenness centrality today and I
> was wondering if you know about it.
> Paper: http://www.cc.gatech.edu/~bader/papers/FastBC-MTAAP2009.pdf
> It seems to be quite fast on our graphs and may be of help for you. Or
> you already know this paper and are using it already (or have decided
> not to for good reasons that we'd be happy to hear about :)) in which
> case you should ignore this email :)
> P.S.: Did we already say thank you for this great toolkit and the super
> fast support? Anyways, let me say thanks again!
> Lars Beckmann
> Uhlenstraße 10
> 33098 Paderborn
> Cell (D2): +49 (0) 178 59 69 150
> Phone: +49 (0) 89 380 123 90
> Fax: +49 (0) 180 102 113 4628
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics (ITI)
Juniorprof. Dr. Henning Meyerhenke
Theoret. Informatics / Parallel Computing
KIT - University of the State of Baden-Wuerttemberg and
National Research Center of the Helmholtz Association
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 5141 bytes
Desc: S/MIME Cryptographic Signature
More information about the NetworKit