{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T15:06:42Z","timestamp":1748617602858,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/bigdata.2013.6691611","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T19:11:49Z","timestamp":1388776309000},"page":"487-492","source":"Crossref","is-referenced-by-count":41,"title":["Incremental algorithms for closeness centrality"],"prefix":"10.1109","author":[{"given":"Ahmet Erdem","family":"Sariyuce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamer","family":"Kaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Saule","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umit V.","family":"Catalyurek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-149"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.76"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/1816123.1816131"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1068\/b34098"},{"key":"16","article-title":"Incremental algorithms for network management and analysis based on closeness centrality","author":"saryuce","year":"2013","journal-title":"CoRR"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69311-6_21"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2010.58"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161100"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1578002.1578008"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1651274.1651282"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"1","article-title":"Direction-optimizing breadth-first search","author":"beamer","year":"2012","journal-title":"Proc of Supercomputing"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187884"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470400"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"4","article-title":"Fast approximation of centrality","author":"eppstein","year":"2001","journal-title":"Proc of SODA"},{"key":"9","article-title":"Mapping networks of terrorist cells","volume":"24","author":"krebs","year":"2002","journal-title":"Connections"},{"key":"8","article-title":"Betweenness centrality: Algorithms and lower bounds","author":"kintali","year":"2008","journal-title":"CoRR"}],"event":{"name":"2013 IEEE International Conference on Big Data","start":{"date-parts":[[2013,10,6]]},"location":"Silicon Valley, CA","end":{"date-parts":[[2013,10,9]]}},"container-title":["2013 IEEE International Conference on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6679357\/6690588\/06691611.pdf?arnumber=6691611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T05:07:41Z","timestamp":1553836061000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6691611\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2013.6691611","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}