k Closeness Centrality Faster in Unweighted Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Elisabetta Bergamini' in GoogleThis author has not been identified. Look up 'Michele Borassi' in GoogleThis author has not been identified. Look up 'Pierluigi Crescenzi' in GoogleThis author has not been identified. Look up 'Andrea Marino' in GoogleThis author has not been identified. Look up 'Henning Meyerhenke' in Google

runs on WebDSL