{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T12:19:54Z","timestamp":1785154794663,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3341161.3344829","type":"proceedings-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T21:07:04Z","timestamp":1579122424000},"page":"1018-1025","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Fast incremental computation of harmonic closeness centrality in directed weighted networks"],"prefix":"10.1145","author":[{"given":"K. (Lynn)","family":"Putman","sequence":"first","affiliation":[{"name":"LIACS, Leiden University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanjo D.","family":"Boekhout","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank W.","family":"Takes","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12599-010-0127-3"},{"key":"e_1_3_2_1_2_1","volume-title":"Sage","author":"Scott J.","year":"2012"},{"key":"e_1_3_2_1_3_1","first-page":"1250","volume-title":"ACM","author":"Kas M.","year":"2013"},{"key":"e_1_3_2_1_4_1","first-page":"196","volume-title":"IEEE","author":"Olsen P. W.","year":"2014"},{"key":"e_1_3_2_1_5_1","first-page":"68","volume-title":"SIAM","author":"Bergamini E.","year":"2016"},{"key":"e_1_3_2_1_6_1","first-page":"21","volume-title":"SIAM","author":"Bisenius P.","year":"2018"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2772233"},{"key":"e_1_3_2_1_8_1","first-page":"384","volume-title":"Springer","author":"Thorup M.","year":"2004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691611"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.01.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.865686"},{"key":"e_1_3_2_1_12_1","unstructured":"M. Chen R. A. Chowdhury V. Ramachandran D. L. Roche and L. Tong Priority queues and Dijkstra's algorithm. Computer Science Department University of Texas at Austin 2007. M. Chen R. A. Chowdhury V. Ramachandran D. L. Roche and L. Tong Priority queues and Dijkstra's algorithm. Computer Science Department University of Texas at Austin 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.053"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"J. Kleinberg \"The small-world phenomenon: An algorithmic perspective \" in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC) 2000 pp. 163--170. J. Kleinberg \"The small-world phenomenon: An algorithmic perspective \" in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC) 2000 pp. 163--170.","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_15_1","unstructured":"J. Leskovec and A. Krevl \"SNAP Datasets: Stanford large network dataset collection \" https:\/\/2.zoppoz.workers.dev:443\/http\/snap.stanford.edu\/data Jun. 2014. J. Leskovec and A. Krevl \"SNAP Datasets: Stanford large network dataset collection \" https:\/\/2.zoppoz.workers.dev:443\/http\/snap.stanford.edu\/data Jun. 2014."},{"key":"e_1_3_2_1_16_1","first-page":"333","volume-title":"ACM","author":"Kumar S.","year":"2018"}],"event":{"name":"ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining","location":"Vancouver British Columbia Canada","acronym":"ASONAM '19","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"]},"container-title":["Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3341161.3344829","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3341161.3344829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:05Z","timestamp":1750206365000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3341161.3344829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":16,"alternative-id":["10.1145\/3341161.3344829","10.1145\/3341161"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3341161.3344829","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2020-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}