"Efficient parallel algorithms for betweenness- and closeness-centrality in ..."

Kshitij Shukla et al. (2020)

> Home

Details and statistics

DOI: 10.1145/3392717.3392743

access: closed

type: Conference or Workshop Paper

metadata version: 2021-12-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ics/ShuklaRTK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ics/ShuklaRTK20
Kshitij Shukla, Sai Charan Regunta, Sai Harsh Tondomker, Kishore Kothapalli:
Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs. ICS 2020: 10:1-10:12

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.