k Closeness Centrality Faster in Unweighted Graphs.">k Closeness Centrality Faster in Unweighted Graphs., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Computing top-k Closeness Centrality Faster in Unweighted Graphs."

Elisabetta Bergamini et al. (2019)

> Home

Details and statistics

DOI: 10.1145/3344719

access: closed

type: Journal Article

metadata version: 2023-06-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tkdd/BergaminiBCMM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkdd/BergaminiBCMM19
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13(5): 53:1-53:40 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.