{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:32Z","timestamp":1750220732110,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore Ministry of Education (MoE) Academic Research Fund","award":["RG 136"],"award-info":[{"award-number":["RG 136"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3341161.3342865","type":"proceedings-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T21:07:04Z","timestamp":1579122424000},"page":"378-385","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient closeness centrality computation in time-evolving graphs"],"prefix":"10.1145","author":[{"given":"Peng","family":"Ni","sequence":"first","affiliation":[{"name":"Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masatoshi","family":"Hanai","sequence":"additional","affiliation":[{"name":"Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen Jun","family":"Tan","sequence":"additional","affiliation":[{"name":"Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wentong","family":"Cai","sequence":"additional","affiliation":[{"name":"Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"P. W. Olsen A. G. Labouseur and J.-H. Hwang \"Efficient top-k closeness centrality search \" in ICDE '14 2014 pp. 196--207.  P. W. Olsen A. G. Labouseur and J.-H. Hwang \"Efficient top-k closeness centrality search \" in ICDE '14 2014 pp. 196--207.","DOI":"10.1109\/ICDE.2014.6816651"},{"volume-title":"Collective dynamics of 'small-world' networks,\" nature","author":"Watts D. J.","key":"e_1_3_2_1_2_1","unstructured":"D. J. Watts and S. H. Strogatz , \" Collective dynamics of 'small-world' networks,\" nature , vol. 393 , no. 6684, p. 440, 1998. D. J. Watts and S. H. Strogatz, \"Collective dynamics of 'small-world' networks,\" nature, vol. 393, no. 6684, p. 440, 1998."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"e_1_3_2_1_4_1","first-page":"237","volume-title":"Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling,\" in WWW '14","author":"Akiba T.","year":"2014","unstructured":"T. Akiba , Y. Iwata , and Y. Yoshida , \" Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling,\" in WWW '14 , 2014 , pp. 237 -- 248 . T. Akiba, Y. Iwata, and Y. Yoshida, \"Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling,\" in WWW '14, 2014, pp. 237--248."},{"key":"e_1_3_2_1_5_1","unstructured":"\"Imdb data from 2006 to 2016 \" https:\/\/www.kaggle.com\/PromptCloudHQ\/imdb-data accessed: 2019-02-20.  \"Imdb data from 2006 to 2016 \" https:\/\/www.kaggle.com\/PromptCloudHQ\/imdb-data accessed: 2019-02-20."},{"key":"e_1_3_2_1_7_1","unstructured":"\"Dblp 2018-01-01 \" http:\/\/dblp.org\/xml\/release\/dblp-2018-01-01.xml.gz accessed: 2019-02-20.  \"Dblp 2018-01-01 \" http:\/\/dblp.org\/xml\/release\/dblp-2018-01-01.xml.gz accessed: 2019-02-20."},{"key":"e_1_3_2_1_8_1","first-page":"1343","volume-title":"the koblenz network collection,\" in WWW '13","author":"Kunegis J.","year":"2013","unstructured":"J. Kunegis , \"Konect : the koblenz network collection,\" in WWW '13 , 2013 , pp. 1343 -- 1350 . J. Kunegis, \"Konect: the koblenz network collection,\" in WWW '13, 2013, pp. 1343--1350."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44543-4_9"},{"key":"e_1_3_2_1_11_1","first-page":"121","volume-title":"Timereach: Historical reachability queries on evolving graphs.\" in EDBT '15","author":"Semertzidis K.","year":"2015","unstructured":"K. Semertzidis , E. Pitoura , and K. Lillis , \" Timereach: Historical reachability queries on evolving graphs.\" in EDBT '15 , 2015 , pp. 121 -- 132 . K. Semertzidis, E. Pitoura, and K. Lillis, \"Timereach: Historical reachability queries on evolving graphs.\" in EDBT '15, 2015, pp. 121--132."},{"key":"e_1_3_2_1_12_1","volume-title":"Efficient temporal shortest path queries on evolving social graphs,\" in SSDBM '14","author":"Huo W.","year":"2014","unstructured":"W. Huo and V. J. Tsotras , \" Efficient temporal shortest path queries on evolving social graphs,\" in SSDBM '14 , 2014 , p. 38. W. Huo and V. J. Tsotras, \"Efficient temporal shortest path queries on evolving social graphs,\" in SSDBM '14, 2014, p. 38."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402713"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.05.004"},{"key":"e_1_3_2_1_15_1","first-page":"1250","volume-title":"Incremental closeness centrality for dynamically changing social networks,\" in ASONAM '13","author":"Kas M.","year":"2013","unstructured":"M. Kas , K. M. Carley , and L. R. Carley , \" Incremental closeness centrality for dynamically changing social networks,\" in ASONAM '13 , 2013 , pp. 1250 -- 1258 . M. Kas, K. M. Carley, and L. R. Carley, \"Incremental closeness centrality for dynamically changing social networks,\" in ASONAM '13, 2013, pp. 1250--1258."},{"key":"e_1_3_2_1_16_1","first-page":"487","volume-title":"Incremental algorithms for closeness centrality,\" in Big Data '13","author":"Sariyuce A. E.","year":"2013","unstructured":"A. E. Sariyuce , K. Kaya , E. Saule , and U. V. Catalyurek , \" Incremental algorithms for closeness centrality,\" in Big Data '13 , 2013 , pp. 487 -- 492 . A. E. Sariyuce, K. Kaya, E. Saule, and U. V. Catalyurek, \"Incremental algorithms for closeness centrality,\" in Big Data '13, 2013, pp. 487--492."},{"key":"e_1_3_2_1_17_1","first-page":"43","volume-title":"Evolving centralities in temporal graphs: a twitter network analysis,\" in MDM '16","author":"Pereira F. S.","year":"2016","unstructured":"F. S. Pereira , S. de Amo , and J. Gama , \" Evolving centralities in temporal graphs: a twitter network analysis,\" in MDM '16 , vol. 2 , 2016 , pp. 43 -- 48 . F. S. Pereira, S. de Amo, and J. Gama, \"Evolving centralities in temporal graphs: a twitter network analysis,\" in MDM '16, vol. 2, 2016, pp. 43--48."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.026107"},{"key":"e_1_3_2_1_19_1","first-page":"1200","volume-title":"Time evolution of the importance of nodes in dynamic networks,\" in ASONAM '15","author":"Magnien C.","year":"2015","unstructured":"C. Magnien and F. Tarissan , \" Time evolution of the importance of nodes in dynamic networks,\" in ASONAM '15 , 2015 , pp. 1200 -- 1207 . C. Magnien and F. Tarissan, \"Time evolution of the importance of nodes in dynamic networks,\" in ASONAM '15, 2015, pp. 1200--1207."}],"event":{"name":"ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Vancouver British Columbia Canada","acronym":"ASONAM '19"},"container-title":["Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342865","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341161.3342865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:25Z","timestamp":1750199905000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":18,"alternative-id":["10.1145\/3341161.3342865","10.1145\/3341161"],"URL":"https:\/\/doi.org\/10.1145\/3341161.3342865","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"}}]}}