k Closeness Centrality Faster in Unweighted Graphs

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke. k Closeness Centrality Faster in Unweighted Graphs. In Michael T. Goodrich, Michael Mitzenmacher, editors, Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016. pages 68-80, SIAM, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.