FRANÇAIS
A showcase of ÉTS researchers’ publications and other contributions
SEARCH

An efficient parallel algorithm for computing the closeness centrality in social networks

Du, Phuong Hanh, Nguyen, Hai Chau, Nguyen, Kim Khoa et Nguyen, Ngoc Hoa. 2018. « An efficient parallel algorithm for computing the closeness centrality in social networks ». In Proceedings of the Ninth International Symposium on Information and Communication Technology (Danang City, Viet Nam, Dec. 6-7, 2018) pp. 456-462. ACM.

The full text of this document is not available here.
Rechercher dans Google Scholar
Item Type: Conference proceeding
Professor:
Professor
Nguyen, Kim Khoa
Affiliation: Génie électrique
Date Deposited: 22 Jan 2019 15:15
Last Modified: 22 Jan 2019 15:15
URI: https://espace2.etsmtl.ca/id/eprint/17971

Actions (login required)

View Item View Item