Computing top-\emphk Closeness Centrality Faster in Unweighted Graphs. Bergamini, E., Borassi, M., Crescenzi, P., Marino, A., & Meyerhenke, H. ACM Trans. Knowl. Discov. Data, 13(5):53:1–53:40, 2019.
Computing top-\emphk Closeness Centrality Faster in Unweighted Graphs [link]Paper  doi  bibtex   
@article{DBLP:journals/tkdd/BergaminiBCMM19,
  author       = {Elisabetta Bergamini and
                  Michele Borassi and
                  Pierluigi Crescenzi and
                  Andrea Marino and
                  Henning Meyerhenke},
  title        = {Computing top-\emph{k} Closeness Centrality Faster in Unweighted Graphs},
  journal      = {{ACM} Trans. Knowl. Discov. Data},
  volume       = {13},
  number       = {5},
  pages        = {53:1--53:40},
  year         = {2019},
  url          = {https://doi.org/10.1145/3344719},
  doi          = {10.1145/3344719},
  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tkdd/BergaminiBCMM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0