Fast and Simple Computation of Top-k Closeness Centralities. Borassi, M., Crescenzi, P., & Marino, A. CoRR, 2015.
Fast and Simple Computation of Top-k Closeness Centralities [link]Paper  bibtex   
@article{DBLP:journals/corr/BorassiCM15,
  author       = {Michele Borassi and
                  Pierluigi Crescenzi and
                  Andrea Marino},
  title        = {Fast and Simple Computation of Top-k Closeness Centralities},
  journal      = {CoRR},
  volume       = {abs/1507.01490},
  year         = {2015},
  url          = {http://arxiv.org/abs/1507.01490},
  eprinttype    = {arXiv},
  eprint       = {1507.01490},
  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorassiCM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0