{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:10:22Z","timestamp":1776784222405,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T00:00:00Z","timestamp":1529366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Research and Development Program of China under grant","award":["2016QY02D0302"],"award-info":[{"award-number":["2016QY02D0302"]}]},{"name":"the National Natural Science Foundation of China Grant","award":["61602195 and 61572216"],"award-info":[{"award-number":["61602195 and 61572216"]}]},{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["2017CFB301"],"award-info":[{"award-number":["2017CFB301"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s11280-018-0605-y","type":"journal-article","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T08:47:14Z","timestamp":1529398034000},"page":"3047-3064","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel computation of hierarchical closeness centrality and applications"],"prefix":"10.1007","volume":"22","author":[{"given":"Hai","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6835-5981","authenticated-orcid":false,"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang-Sheng","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuanhua","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xia","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,19]]},"reference":[{"issue":"1","key":"605_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W Aiello","year":"2001","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Exp. Math. 10(1), 53\u201366 (2001)","journal-title":"Exp. Math."},{"key":"605_CR2","unstructured":"Al-Baghdadi, A.: Computing Top-K Closeness Centrality in Unweighted Undirected Graphs Revisited. Ph.D. thesis (2017)"},{"issue":"17","key":"605_CR3","first-page":"1","volume":"7","author":"L Bargigli","year":"2013","unstructured":"Bargigli, L., Gallegati, M.: Finding communities in credit networks. Economics 7(17), 1 (2013)","journal-title":"Economics"},{"issue":"6","key":"605_CR4","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas, A.: Communication Patterns in Task-Oriented Groups. J. Acoust. Soc. Am. 22(6), 725\u2013730 (1950)","journal-title":"J. Acoust. Soc. Am."},{"key":"605_CR5","doi-asserted-by":"crossref","unstructured":"Bergamini, E., Borassi, M., Crescenzi, P., Marino, A., Meyerhenke, H.: Computing top-k closeness centrality faster in unweighted graphs. In: Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX), vol. V, pp. 68\u201380 (2016)","DOI":"10.1137\/1.9781611974317.6"},{"issue":"7","key":"605_CR6","first-page":"2303","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. Other 17(7), 2303\u20132318 (2007)","journal-title":"Other"},{"key":"605_CR7","unstructured":"Cutts, M.: How does Google collect and rank results? http:\/\/www.google.com\/librariancenter\/articles\/0601_03.html (2010)"},{"key":"605_CR8","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of the of the OSDI, pp. 137\u2013149 (2004)"},{"issue":"1","key":"605_CR9","first-page":"2","volume":"8","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D., Wang, J.: Fast Approximation of Centrality. J. Graph Algorithms Appl. 8(1), 2 (2000)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"605_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35 (1977)","journal-title":"Sociometry"},{"issue":"9","key":"605_CR11","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1007\/s11432-010-4043-4","volume":"53","author":"L Fu","year":"2010","unstructured":"Fu, L., Gao, L., Ma, X.: A centrality measure based on spectral optimization of modularity density. Sci. China Inf. Sci. 53(9), 1727\u20131737 (2010)","journal-title":"Sci. China Inf. Sci."},{"issue":"12","key":"605_CR12","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M. E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"7","key":"605_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-013-5047-7","volume":"57","author":"Q Gu","year":"2014","unstructured":"Gu, Q., Xiong, S., Chen, D.: Correlations between characteristics of maximum influence and degree distributions in software networks. Sci. China Inf. Sci. 57(7), 1\u201312 (2014)","journal-title":"Sci. China Inf. Sci."},{"key":"605_CR14","doi-asserted-by":"crossref","unstructured":"Hossmann, T., Spyropoulos, T., Legendre, F.: A complex network analysis of human mobility. In: 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 876\u2013881 (2011)","DOI":"10.1109\/INFCOMW.2011.5928936"},{"key":"605_CR15","doi-asserted-by":"crossref","unstructured":"Inariba, W.: Random-radius ball method for estimating closeness centrality. In: Proceedings of the 31th Conference on Artificial Intelligence (AAAI 2017), pp. 125\u2013131 (2017)","DOI":"10.1609\/aaai.v31i1.10498"},{"key":"605_CR16","doi-asserted-by":"crossref","unstructured":"Kang, U.: Centralities in large networks: algorithms and observations. In: SIAM International Conference on Data, pp. 119\u2013130 (2011)","DOI":"10.1137\/1.9781611972818.11"},{"key":"605_CR17","unstructured":"Mora, R., Gutierrez, C.: Random-walk closeness centrality satisfies boldi-vigna axioms. In: CEUR Workshop Proceedings, vol. 1378, pp. 110\u2013120 (2015)"},{"key":"605_CR18","doi-asserted-by":"crossref","unstructured":"Okamoto, K., Chen, W., Li, X.Y.: Ranking of closness centrality for large-scale social networks. In: Proceedings of the 2nd Annual International Workshop on Frontiers in Algorithmics, pp. 186\u2013195 (2008)","DOI":"10.1007\/978-3-540-69311-6_21"},{"key":"605_CR19","doi-asserted-by":"crossref","unstructured":"Olsen, P.W., Labouseur, A.G., Hwang, J.H.: Efficient top-k closeness centrality search. In: Proceedings of ICDE, pp. 196\u2013207 (2014)","DOI":"10.1109\/ICDE.2014.6816651"},{"key":"605_CR20","doi-asserted-by":"crossref","unstructured":"Olsen, PW Jr., Labouseur, A.G., Hwang, J.H.: Efficient top-k closeness centrality search 196\u2013207 (2014)","DOI":"10.1109\/ICDE.2014.6816651"},{"issue":"1","key":"605_CR21","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1186\/1471-2105-15-220","volume":"15","author":"P Sah","year":"2014","unstructured":"Sah, P., Singh, L. O., Clauset, A., Bansal, S.: Exploring community structure in biological networks with random graphs. BMC Bioinf. 15(1), 220 (2014)","journal-title":"BMC Bioinf."},{"key":"605_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.parco.2015.01.003","volume":"47","author":"AE Sariy\u00fcce","year":"2015","unstructured":"Sariy\u00fcce, A.E., Saule, E., Kaya, K., \u00c7ataly\u00fcrek, \u00dc.V.: Incremental closeness centrality in distributed memory. Parallel Comput. 47, 3\u201318 (2015)","journal-title":"Parallel Comput."},{"key":"605_CR23","doi-asserted-by":"crossref","unstructured":"Zhuang, H., Sun, Y., Tang, J., Zhang, J., Sun, X.: Influence maximization in dynamic social networks. In: 2013 IEEE 13th International Conference on Data Mining (ICDM). IEEE, pp. 1313\u20131318 (2013)","DOI":"10.1109\/ICDM.2013.145"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0605-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-018-0605-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0605-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T05:57:52Z","timestamp":1751695072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-018-0605-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,19]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["605"],"URL":"https:\/\/doi.org\/10.1007\/s11280-018-0605-y","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,19]]},"assertion":[{"value":"15 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}