Fast, Simple, and Exact Computation of Top-k Closeness Centralities. Borassi, M., Crescenzi, P., & Marino, A. 2015. Submitted. See ˘rlhttp://arxiv.org/abs/1507.01490
bibtex   
@misc{algorithmica2015,
 author    = {Michele Borassi and
               Pierluigi Crescenzi and
               Andrea Marino },
  title     = {Fast, Simple, and Exact Computation of Top-k Closeness Centralities},
  year      = {2015},
 note    = {Submitted. See \url{http://arxiv.org/abs/1507.01490}}
}

Downloads: 0