@article{DBLP:journals/corr/BergaminiBCMM17,
  author    = {Elisabetta Bergamini and
               Michele Borassi and
               Pierluigi Crescenzi and
               Andrea Marino and
               Henning Meyerhenke},
  title     = {Computing top-k Closeness Centrality Faster in Unweighted Graphs},
  journal   = {CoRR},
  volume    = {abs/1704.01077},
  year      = {2017},
  url       = {http://arxiv.org/abs/1704.01077},
  eprinttype = {arXiv},
  eprint    = {1704.01077},
  timestamp = {Mon, 13 Aug 2018 16:48:41 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BergaminiBCMM17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}