@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, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tkdd/BergaminiBCMM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"p4kZ8mFCmQNqyLuB7","bibbaseid":"bergamini-borassi-crescenzi-marino-meyerhenke-computingtopemphkclosenesscentralityfasterinunweightedgraphs-2019","author_short":["Bergamini, E.","Borassi, M.","Crescenzi, P.","Marino, A.","Meyerhenke, H."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Elisabetta"],"propositions":[],"lastnames":["Bergamini"],"suffixes":[]},{"firstnames":["Michele"],"propositions":[],"lastnames":["Borassi"],"suffixes":[]},{"firstnames":["Pierluigi"],"propositions":[],"lastnames":["Crescenzi"],"suffixes":[]},{"firstnames":["Andrea"],"propositions":[],"lastnames":["Marino"],"suffixes":[]},{"firstnames":["Henning"],"propositions":[],"lastnames":["Meyerhenke"],"suffixes":[]}],"title":"Computing top-\\emphk 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, 19 Jan 2025 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/tkdd/BergaminiBCMM19.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/tkdd/BergaminiBCMM19,\n author = {Elisabetta Bergamini and\n Michele Borassi and\n Pierluigi Crescenzi and\n Andrea Marino and\n Henning Meyerhenke},\n title = {Computing top-\\emph{k} Closeness Centrality Faster in Unweighted Graphs},\n journal = {{ACM} Trans. Knowl. Discov. Data},\n volume = {13},\n number = {5},\n pages = {53:1--53:40},\n year = {2019},\n url = {https://doi.org/10.1145/3344719},\n doi = {10.1145/3344719},\n timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/tkdd/BergaminiBCMM19.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Bergamini, E.","Borassi, M.","Crescenzi, P.","Marino, A.","Meyerhenke, H."],"key":"DBLP:journals/tkdd/BergaminiBCMM19","id":"DBLP:journals/tkdd/BergaminiBCMM19","bibbaseid":"bergamini-borassi-crescenzi-marino-meyerhenke-computingtopemphkclosenesscentralityfasterinunweightedgraphs-2019","role":"author","urls":{"Paper":"https://doi.org/10.1145/3344719"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/57/7900.bib","dataSources":["kdGZkBFQjQnnvMnEr"],"keywords":[],"search_terms":["computing","top","emphk","closeness","centrality","faster","unweighted","graphs","bergamini","borassi","crescenzi","marino","meyerhenke"],"title":"Computing top-\\emphk Closeness Centrality Faster in Unweighted Graphs","year":2019}