"Computing Top-k Closeness Centrality in Fully-dynamic Graphs."

Patrick Bisenius et al. (2018)

> Home

Details and statistics

DOI: 10.1137/1.9781611975055.3

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/alenex/BiseniusBAM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alenex/BiseniusBAM18
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. ALENEX 2018: 21-35

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.