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

Eugenio Angriman et al. (2022)

> Home

Details and statistics

DOI: 10.1201/9781003033707-10

access: closed

type: Part in Book or Collection

metadata version: 2023-11-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/crc/22/AngrimanBBM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/crc/22/AngrimanBBM22
Eugenio Angriman, Patrick Bisenius, Elisabetta Bergamini, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully Dynamic Graphs. Massive Graph Analytics 2022: 161-192

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.