{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:47:06Z","timestamp":1780634826485,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":0,"URL":"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":[[2014,10]]},"DOI":"10.1145\/2660460.2660465","type":"proceedings-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T13:35:08Z","timestamp":1412170508000},"page":"37-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Computing classic closeness centrality, at scale"],"prefix":"10.1145","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,10]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"130","article-title":"Barab asi. Internet","volume":"401","author":"Albert R.","year":"1999","unstructured":"R. Albert , H. Jeong , and A.-L . Barab asi. Internet : Diameter of the World-Wide Web. Nature , 401 : 130 -- 131 , September 1999 . R. Albert, H. Jeong, and A.-L. Barab asi. Internet: Diameter of the World-Wide Web. Nature, 401:130--131, September 1999.","journal-title":"Diameter of the World-Wide Web. Nature"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380718.2380723"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.17730\/humo.7.3.f4033344851gl053"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1121\/1.1906679"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/bs.3830100205"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963493"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050728.2050738"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2606262.2606545"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.865686"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/69.3.653"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331610"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594546"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/10079817X"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.016"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281133"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987334.1987345"},{"key":"e_1_3_2_1_21_1","first-page":"365","article-title":"Residual closeness in networks","author":"Dangalchev C.","year":"2006","unstructured":"C. Dangalchev . Residual closeness in networks . Phisica A , 365 , 2006 . C. Dangalchev. Residual closeness in networks. Phisica A, 365, 2006.","journal-title":"Phisica A"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep02980"},{"key":"e_1_3_2_1_23_1","volume-title":"DIMACS Book 74","author":"Demetrescu C.","year":"2009","unstructured":"C. Demetrescu , A. V. Goldberg , and D. S. Johnson , editors . The Shortest Path Problem: Ninth DIMACS Implementation Challenge , DIMACS Book 74 . American Mathematical Society , 2009 . C. Demetrescu, A. V. Goldberg, and D. S. Johnson, editors. The Shortest Path Problem: Ninth DIMACS Implementation Challenge, DIMACS Book 74. American Mathematical Society, 2009."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314690.1314696"},{"key":"e_1_3_2_1_25_1","first-page":"228","volume-title":"SODA","author":"Eppstein D.","year":"2001","unstructured":"D. Eppstein and J. Wang . Fast approximation of centrality . In SODA , pp. 228 -- 229 , 2001 . D. Eppstein and J. Wang. Fast approximation of centrality. In SODA, pp. 228--229, 2001."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_27_1","first-page":"1","article-title":"Centrality in social networks: Conceptual clarification","author":"Freeman L. C.","year":"1979","unstructured":"L. C. Freeman . Centrality in social networks: Conceptual clarification . Social Networks , 1 , 1979 . L. C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1, 1979.","journal-title":"Social Networks"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301366"},{"key":"e_1_3_2_1_30_1","volume-title":"Vol 2, Seminumerical Algorithms","author":"Knuth D. E.","year":"1968","unstructured":"D. E. Knuth . The Art of Computer Programming , Vol 2, Seminumerical Algorithms . Addison-Wesley , 1 st edition, 1968 . D. E. Knuth. The Art of Computer Programming, Vol 2, Seminumerical Algorithms. Addison-Wesley, 1st edition, 1968.","edition":"1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_35_1","volume-title":"Foundations of Social Search","author":"Lin N.","year":"1976","unstructured":"N. Lin . Foundations of Social Search . McGraw-Hill Book Co. , New York , 1976 . N. Lin. Foundations of Social Search. McGraw-Hill Book Co., New York, 1976."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1455266"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.978369"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"issue":"2","key":"e_1_3_2_1_39_1","first-page":"149","article-title":"Sequential poisson sampling","volume":"14","author":"Ohlsson E.","year":"1998","unstructured":"E. Ohlsson . Sequential poisson sampling . J. Official Statistics , 14 ( 2 ): 149 -- 162 , 1998 . E. Ohlsson. Sequential poisson sampling. J. Official Statistics, 14(2):149--162, 1998.","journal-title":"J. Official Statistics"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69311-6_21"},{"key":"e_1_3_2_1_41_1","first-page":"32","article-title":"Node centrality in weighted networks: Generalizing degree and shortest paths","author":"Opsahl T.","year":"2010","unstructured":"T. Opsahl , F. Agneessens , and J. Skvoretz . Node centrality in weighted networks: Generalizing degree and shortest paths . Social Networks , 32 , 2010 . http:\/\/toreopsahl.com\/2010\/03\/20\/. T. Opsahl, F. Agneessens, and J. Skvoretz. Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32, 2010. http:\/\/toreopsahl.com\/2010\/03\/20\/.","journal-title":"Social Networks"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_3_2_1_43_1","first-page":"351","volume-title":"The Semantic Web -- ISWC","author":"Richardson M.","year":"2003","unstructured":"M. Richardson , R. Agrawal , and P. Domingos . Trust management for the semantic web . In The Semantic Web -- ISWC 2003 , pp. 351 -- 368 . Springer , 2003. M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic web. In The Semantic Web -- ISWC 2003, pp. 351--368. Springer, 2003."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289527"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409097"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2197681"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684103"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220006"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"Wasserman S.","year":"1994","unstructured":"S. Wasserman and K. Faust , editors . Social Network Analysis: Methods and Applications . Cambridge University Press , 1994 . S. Wasserman and K. Faust, editors. Social Network Analysis: Methods and Applications. Cambridge University Press, 1994."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"}],"event":{"name":"COSN'14: Conference on Online Social Networks","location":"Dublin Ireland","acronym":"COSN'14","sponsor":["ACM Association for Computing Machinery"]},"container-title":["Proceedings of the second ACM conference on Online social networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660460.2660465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660460.2660465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:11:54Z","timestamp":1750227114000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660460.2660465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":52,"alternative-id":["10.1145\/2660460.2660465","10.1145\/2660460"],"URL":"https:\/\/doi.org\/10.1145\/2660460.2660465","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"2014-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}