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

Elisabetta Bergamini et al. (2016)

> Home

Details and statistics

DOI: 10.1137/1.9781611974317.6

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/alenex/BergaminiBCMM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alenex/BergaminiBCMM16
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing Top-k Closeness Centrality Faster in Unweighted Graphs. ALENEX 2016: 68-80

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.