{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:24Z","timestamp":1750221084991,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":23,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3287921.3287981","type":"proceedings-article","created":{"date-parts":[[2018,12,13]],"date-time":"2018-12-13T15:45:16Z","timestamp":1544715916000},"page":"456-462","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Parallel Algorithm for Computing the Closeness Centrality in Social Networks"],"prefix":"10.1145","author":[{"given":"Phuong Hanh","family":"Du","sequence":"first","affiliation":[{"name":"VNU University of Engineering and Technology, Hanoi, Vietnam"}]},{"given":"Hai Chau","family":"Nguyen","sequence":"additional","affiliation":[{"name":"VNU University of Engineering and Technology, Hanoi, Vietnam"}]},{"given":"Kim Khoa","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Ecole Superieure de Technologie Montreal, QC, Canada"}]},{"given":"Ngoc Hoa","family":"Nguyen","sequence":"additional","affiliation":[{"name":"VNU University of Engineering and Technology, Hanoi, Vietnam"}]}],"member":"320","reference":[{"key":"key-10.1145\/3287921.3287981-1","doi-asserted-by":"crossref","unstructured":"V. T. Chakaravarthy, F. Checconi, F. Petrini, and Y. Sabharwal. 2014. Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems. In 2014 IEEE 28th International Parallel and Distributed Processing Symposium. 889--901. https:\/\/doi.org\/10.1109\/IPDPS.2014.96","DOI":"10.1109\/IPDPS.2014.96"},{"key":"key-10.1145\/3287921.3287981-2","doi-asserted-by":"crossref","unstructured":"Duanbing Chen, Linyuan L, Ming-Sheng Shang, Yi-Cheng Zhang, and Tao Zhou. 2012. Identifying influential nodes in complex networks. Physica A: Statistical Mechanics and its Applications 391, 4 (2012), 1777--1787. https:\/\/doi.org\/10.1016\/j.physa.2011.09.017","DOI":"10.1016\/j.physa.2011.09.017"},{"key":"key-10.1145\/3287921.3287981-3","doi-asserted-by":"crossref","unstructured":"Phuong-Hanh DU, Hai-Dang PHAM, and Ngoc-Hoa NGUYEN. 2016. Optimizing the Shortest Path Query on Large-scale Dynamic Directed Graph. In Proceedings of the 3rd IEEE\/ACM International Conference on Big Data Computing, Applications and Technologies (BDCAT '16). ACM, New York, NY, USA, 210--216. https:\/\/doi.org\/10.1145\/3006299.3006321","DOI":"10.1145\/3006299.3006321"},{"key":"key-10.1145\/3287921.3287981-4","doi-asserted-by":"crossref","unstructured":"Yogesh K. Dwivedi, Nripendra P. Rana, Mina Tajvidi, Banita Lal, G. P. Sahu, and Ashish Gupta. 2017. Exploring the Role of Social Media in e-Government: An Analysis of Emerging Literature. In Proceedings of the 10th International Conference on Theory and Practice of Electronic Governance (ICEGOV '17). ACM, New York, NY, USA, 97--106. https:\/\/doi.org\/10.1145\/3047273.3047374","DOI":"10.1145\/3047273.3047374"},{"key":"key-10.1145\/3287921.3287981-5","doi-asserted-by":"crossref","unstructured":"A. Farooq, G. J. Joyia, M. Uzair, and U. Akram. 2018. Detection of influential nodes using social networks analysis based on network metrics. In 2018 International Conference on Computing, Mathematics and Engineering Technologies (iCoMET). 1--6. https:\/\/doi.org\/10.1109\/ICOMET.2018.8346372","DOI":"10.1109\/ICOMET.2018.8346372"},{"key":"key-10.1145\/3287921.3287981-6","doi-asserted-by":"crossref","unstructured":"Linton C. Freeman. 1977. A Set of Measures of Centrality Based on Betweenness. Sociometry 40, 1 (1977), 35--41. http:\/\/www.jstor.org\/stable\/3033543","DOI":"10.2307\/3033543"},{"key":"key-10.1145\/3287921.3287981-7","unstructured":"Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-parallel Computation on Natural Graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12). USENIX Association, Berkeley, CA, USA, 17--30. http:\/\/dl.acm.org\/citation.cfm?id=2387880.2387883"},{"key":"key-10.1145\/3287921.3287981-8","unstructured":"Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring Network Structure, Dynamics, and Function using NetworkX. In Proceedings of the 7th Python in Science Conference, Gaël Varoquaux, Travis Vaught, and Jarrod Millman (Eds.). Pasadena, CA USA, 11--15."},{"key":"key-10.1145\/3287921.3287981-9","doi-asserted-by":"crossref","unstructured":"U. Kang, Spiros Papadimitriou, Jimeng Sun, and Hanghang Tong. 2011. Centralities in Large Networks: Algorithms and Observations. In SDM.","DOI":"10.1137\/1.9781611972818.11"},{"key":"key-10.1145\/3287921.3287981-10","doi-asserted-by":"crossref","unstructured":"R. T. Khasawneh and M. M. Tarawneh. 2016. Citizens' attitudes towards e-government presence on social networks (e-government 2.0): An empirical study. In 2016 7th International Conference on Information and Communication Systems (ICICS). 45--49. https:\/\/doi.org\/10.1109\/IACS.2016.7476084","DOI":"10.1109\/IACS.2016.7476084"},{"key":"key-10.1145\/3287921.3287981-11","doi-asserted-by":"crossref","unstructured":"Jungeun Kim and Jae-Gil Lee. 2015. Community Detection in Multi-Layer Graphs: A Survey. SIGMOD Rec. 44, 3 (Dec. 2015), 37--48. https:\/\/doi.org\/10.1145\/2854006.2854013","DOI":"10.1145\/2854006.2854013"},{"key":"key-10.1145\/3287921.3287981-12","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/ data."},{"key":"key-10.1145\/3287921.3287981-13","unstructured":"Jure Leskovec and Rok Sosič. 2016. SNAP: A General-Purpose Network Analysis and Graph-Mining Library. ACM Transactions on Intelligent Systems and Technology (TIST) 8, 1 (2016), 1."},{"key":"key-10.1145\/3287921.3287981-14","doi-asserted-by":"crossref","unstructured":"A. Louni and K. P. Subbalakshmi. 2018. Who Spread That Rumor: Finding the Source of Information in Large Online Social Networks With Probabilistically Varying Internode Relationship Strengths. IEEE Transactions on Computational Social Systems 5, 2 (June 2018), 335--343. https:\/\/doi.org\/10.1109\/TCSS.2018.2801310","DOI":"10.1109\/TCSS.2018.2801310"},{"key":"key-10.1145\/3287921.3287981-15","doi-asserted-by":"crossref","unstructured":"Evelien Otte and Ronald Rousseau. 2002. Social network analysis: a powerful strategy, also for the information sciences. Journal of Information Science 28, 6 (2002), 441--453. https:\/\/doi.org\/10.1177\/016555150202800601","DOI":"10.1177\/016555150202800601"},{"key":"key-10.1145\/3287921.3287981-16","doi-asserted-by":"crossref","unstructured":"M. Park, S. Lee, O. Kwon, and A. Seuret. 2018. Closeness-Centrality-Based Synchronization Criteria for Complex Dynamical Networks With Interval Time-Varying Coupling Delays. IEEE Transactions on Cybernetics 48, 7 (July 2018), 2192--2202. https:\/\/doi.org\/10.1109\/TCYB.2017.2729164","DOI":"10.1109\/TCYB.2017.2729164"},{"key":"key-10.1145\/3287921.3287981-17","unstructured":"Du PH., Pham HD., and Nguyen NH. 2018. An Efficient Parallel Method for Optimizing Concurrent Operations on Social Networks. Transactions on Computational Collective Intelligence 10840, XXIX (April 2018), 182--199. https:\/\/doi.org\/10.1007\/978-3-319-90287-6-10"},{"key":"key-10.1145\/3287921.3287981-18","unstructured":"NH. Nguyen PH. Du, HD. Pham. 2017. Source code of bigGraph. https:\/\/github.com\/nnhoa\/bigGraph."},{"key":"key-10.1145\/3287921.3287981-19","unstructured":"The Statistics Portal. 2018. Most famous social network sites worldwide as of July 2018. https:\/\/www.statista.com\/statistics\/272014\/global-social-networks-ranked-by-number-of-users\/."},{"key":"key-10.1145\/3287921.3287981-20","unstructured":"Christian Staudt, Aleksejs Sazonovs, and Henning Meyerhenke. 2014. NetworKit: An Interactive Tool Suite for High-Performance Network Analysis. CoRR abs\/1403.3005 (2014). http:\/\/arxiv.org\/abs\/1403.3005"},{"key":"key-10.1145\/3287921.3287981-21","doi-asserted-by":"crossref","unstructured":"Frank W. Takes and Eelke M. Heemskerk. 2016. Centrality in the Global Network of Corporate Control. CoRR abs\/1605.08197 (2016).","DOI":"10.1007\/s13278-016-0402-5"},{"key":"key-10.1145\/3287921.3287981-22","doi-asserted-by":"crossref","unstructured":"J. Wei, K. Chen, Y. Zhou, Q. Zhou, and J. He. 2016. Benchmarking of Distributed Computing Engines Spark and GraphLab for Big Data Analytics. In 2016 IEEE Second International Conference on Big Data Computing Service and Applications (BigDataService). 10--13. https:\/\/doi.org\/10.1109\/BigDataService.2016.11","DOI":"10.1109\/BigDataService.2016.11"},{"key":"key-10.1145\/3287921.3287981-23","doi-asserted-by":"crossref","unstructured":"Yutao Zhang, Jie Tang, Zhilin Yang, Jian Pei, and Philip S. Yu. 2015. COSNET: Connecting Heterogeneous Social Networks with Local and Global Consistency. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '15). ACM, New York, NY, USA, 1485--1494. https:\/\/doi.org\/10.1145\/2783258.2783268","DOI":"10.1145\/2783258.2783268"}],"event":{"number":"9","sponsor":["SOICT, School of Information and Communication Technology - HUST","NAFOSTED, The National Foundation for Science and Technology Development"],"acronym":"SoICT 2018","name":"the Ninth International Symposium","start":{"date-parts":[[2018,12,6]]},"location":"Danang City, Viet Nam","end":{"date-parts":[[2018,12,7]]}},"container-title":["Proceedings of the Ninth International Symposium on Information and Communication Technology - SoICT 2018"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3287921.3287981","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3287981&ftid=2025968&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:45Z","timestamp":1750208265000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3287921.3287981"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1145\/3287921.3287981","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}