"An Efficient Parallel Algorithm for Computing the Closeness Centrality in ..."

Phuong-Hanh Du et al. (2018)

> Home

Details and statistics

DOI: 10.1145/3287921.3287981

access: closed

type: Conference or Workshop Paper

metadata version: 2022-02-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/soict/DuNNN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soict/DuNNN18
Phuong-Hanh Du, Nguyen Hai Chau, Kim Khoa Nguyen, Ngoc-Hoa Nguyen:
An Efficient Parallel Algorithm for Computing the Closeness Centrality in Social Networks. SoICT 2018: 456-462

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.