{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:42:21Z","timestamp":1773895341563,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:00Z","timestamp":1566950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:00Z","timestamp":1566950400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100009193","name":"Marsden Fund","doi-asserted-by":"publisher","award":["UOA1732"],"award-info":[{"award-number":["UOA1732"]}],"id":[{"id":"10.13039\/501100009193","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP160101513"],"award-info":[{"award-number":["DP160101513"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["FT170100128"],"award-info":[{"award-number":["FT170100128"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP180103096"],"award-info":[{"award-number":["DP180103096"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DE150100563"],"award-info":[{"award-number":["DE150100563"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672235"],"award-info":[{"award-number":["61672235"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP170101628"],"award-info":[{"award-number":["DP170101628"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00778-019-00566-9","type":"journal-article","created":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T20:05:20Z","timestamp":1567022720000},"page":"765-792","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Eccentricities on small-world networks"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4941-8814","authenticated-orcid":false,"given":"Wentao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,28]]},"reference":[{"issue":"4","key":"566_CR1","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1137\/S0097539796303421","volume":"28","author":"D Aingworth","year":"1999","unstructured":"Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28(4), 1167\u20131181 (1999)","journal-title":"SIAM J. Comput."},{"key":"566_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-20086-6_5","volume-title":"Experimental Algorithms","author":"Takuya Akiba","year":"2015","unstructured":"Akiba, T., Iwata, Y., Kawata, Y.: An exact algorithm for diameters of large real directed graphs. In: International Symposium on Experimental Algorithms, pp. 56\u201367. Springer, Berlin (2015)"},{"key":"566_CR3","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 349\u2013360. ACM, New York (2013)","DOI":"10.1145\/2463676.2465315"},{"key":"566_CR4","doi-asserted-by":"crossref","unstructured":"Almeida, P., Baquero, C., Cunha, A.: Fast distributed computation of distances in networks. In: 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), pp. 5215\u20135220. IEEE, New York (2012)","DOI":"10.1109\/CDC.2012.6426872"},{"key":"566_CR5","doi-asserted-by":"crossref","unstructured":"Bisenius, P., Bergamin, E., Angriman, E., Meyerhenke, H.: Computing top-k closeness centrality in fully-dynamic graphs. In: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 21\u201335. SIAM (2018)","DOI":"10.1137\/1.9781611975055.3"},{"key":"566_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2015.02.033","volume":"586","author":"M Borassi","year":"2015","unstructured":"Borassi, M., Crescenzi, P., Habib, M., Kosters, W.A., Marino, A., Takes, F.W.: Fast diameter and radius bfs-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. Theoret. Comput. Sci. 586, 59\u201380 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"566_CR7","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: All-pairs shortest paths for unweighted undirected graphs in o (mn) time. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 514\u2013523. Society for Industrial and Applied Mathematics (2006)","DOI":"10.1145\/1109557.1109614"},{"key":"566_CR8","doi-asserted-by":"crossref","unstructured":"Chechik, S., Larkin, D.H., Roditty, L., Schoenebeck, G., Tarjan, R.E., Williams, V.V.: Better approximation algorithms for the graph diameter. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1041\u20131052. Society for Industrial and Applied Mathematics, Philadelphia (2014)","DOI":"10.1137\/1.9781611973402.78"},{"issue":"4","key":"566_CR9","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/1198513.1198519","volume":"2","author":"C Demetrescu","year":"2006","unstructured":"Demetrescu, C., Italiano, G.F.: Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithm. (TALG) 2(4), 578\u2013601 (2006)","journal-title":"ACM Trans. Algorithm. (TALG)"},{"key":"566_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-20149-3_24","volume-title":"Database Systems for Advanced Applications","author":"Yasuhiro Fujiwara","year":"2011","unstructured":"Fujiwara, Y., Onizuka, M., Kitsuregawa, M.: Real-time diameter monitoring for time-evolving graphs. In: International Conference on Database Systems for Advanced Applications, pp. 311\u2013325. Springer, Berlin (2011)"},{"key":"566_CR11","first-page":"299","volume":"35","author":"ME Gaston","year":"2006","unstructured":"Gaston, M.E., Kraetzl, M., Wallis, W.D.: Using graph diameter for change detection in dynamic networks. Australas. J. Comb. 35, 299\u2013311 (2006)","journal-title":"Australas. J. Comb."},{"key":"566_CR12","volume-title":"Six Degrees of Separation: A Play","author":"J Guare","year":"1990","unstructured":"Guare, J.: Six Degrees of Separation: A Play. Vintage, New York (1990)"},{"key":"566_CR13","doi-asserted-by":"crossref","unstructured":"Henderson, K.: Opex: Optimized eccentricity computation in graphs. Technical report, Lawrence Livermore National Lab.(LLNL), Livermore, CA (2011)","DOI":"10.2172\/1113361"},{"issue":"1","key":"566_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM (JACM) 24(1), 1\u201313 (1977)","journal-title":"J. ACM (JACM)"},{"key":"566_CR15","doi-asserted-by":"crossref","unstructured":"Kas, M., Carley, K.M., Carley, L.R.: Incremental closeness centrality for dynamically changing social networks. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1250\u20131258. ACM, New York (2013)","DOI":"10.1145\/2492517.2500270"},{"key":"566_CR16","unstructured":"Leskovec, J., Krevl, A.: Snap datasets: Stanford large network dataset collection (2014). \n                    http:\/\/snap.stanford.edu\/data"},{"key":"566_CR17","doi-asserted-by":"crossref","unstructured":"Li, Z., Sun, D., Xu, F., Li, B.: Social network based anomaly detection of organizational behavior using temporal pattern mining. In: Proceedings of the 2017 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, pp. 1112\u20131119. ACM, New York (2017)","DOI":"10.1145\/3110025.3116200"},{"key":"566_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., Zhou, T.: Vital nodes identification in complex networks. Phys. Rep. 650, 1\u201363 (2016)","journal-title":"Phys. Rep."},{"issue":"3","key":"566_CR19","doi-asserted-by":"publisher","first-page":"102","DOI":"10.3390\/a10030102","volume":"10","author":"E Nathan","year":"2017","unstructured":"Nathan, E., Zakrzewska, A., Riedy, J., Bader, D.: Local community detection in dynamic graphs using personalized centrality. Algorithms 10(3), 102 (2017)","journal-title":"Algorithms"},{"issue":"1","key":"566_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"MEJ Newman","year":"2005","unstructured":"Newman, M.E.J.: A measure of betweenness centrality based on random walks. Social Netw. 27(1), 39\u201354 (2005)","journal-title":"Social Netw."},{"key":"566_CR21","doi-asserted-by":"crossref","unstructured":"Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. In: International Workshop on Frontiers in Algorithmics, pp. 186\u2013195. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-69311-6_21"},{"issue":"5","key":"566_CR22","first-page":"61","volume":"12","author":"M Riondato","year":"2018","unstructured":"Riondato, M., Upfal, E.: Abra: Approximating betweenness centrality in static and dynamic graphs with rademacher averages. ACM Trans. Knowl. Discov. Data (TKDD) 12(5), 61 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"566_CR23","doi-asserted-by":"crossref","unstructured":"Roditty, L., Vassilevska Williams, V.: Fast approximation algorithms for the diameter and radius of sparse graphs. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 515\u2013524. ACM, New York (2013)","DOI":"10.1145\/2488608.2488673"},{"issue":"2","key":"566_CR24","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s11280-016-0394-0","volume":"20","author":"M Sagharichian","year":"2017","unstructured":"Sagharichian, M., Langouri, M.A., Naderi, H.: A fast method to exactly calculate the diameter of incremental disconnected graphs. World Wide Web 20(2), 399\u2013416 (2017)","journal-title":"World Wide Web"},{"key":"566_CR25","doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce, A.E., Kaya, K., Saule, E., \u00c7atalyiirek, \u00dc.V.: Incremental algorithms for closeness centrality. In: 2013 IEEE International Conference on Big Data, pp. 487\u2013492. IEEE, New York (2013)","DOI":"10.1109\/BigData.2013.6691611"},{"key":"566_CR26","doi-asserted-by":"crossref","unstructured":"Shun, J.: An evaluation of parallel eccentricity estimation algorithms on undirected real-world graphs. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1095\u20131104. ACM, New York (2015)","DOI":"10.1145\/2783258.2783333"},{"issue":"1","key":"566_CR27","doi-asserted-by":"publisher","first-page":"100","DOI":"10.3390\/a6010100","volume":"6","author":"F Takes","year":"2013","unstructured":"Takes, F., Kosters, W.: Computing the eccentricity distribution of large graphs. Algorithms 6(1), 100\u2013118 (2013)","journal-title":"Algorithms"},{"key":"566_CR28","doi-asserted-by":"crossref","unstructured":"Takes, F.W., Kosters, W.A.: Determining the diameter of small world networks. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 1191\u20131196. ACM, New York (2011)","DOI":"10.1145\/2063576.2063748"},{"issue":"4","key":"566_CR29","doi-asserted-by":"publisher","first-page":"449","DOI":"10.14778\/2735496.2735507","volume":"8","author":"M Then","year":"2014","unstructured":"Then, M., Kaufmann, M., Chirigati, F., Hoang-Vu, T.-A., Pham, K., Kemper, A., Neumann, T., Huy, T.V.: The more the merrier: efficient multi-source graph traversal. Proc. VLDB Endow. 8(4), 449\u2013460 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"6684","key":"566_CR30","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"key":"566_CR31","volume-title":"Introduction to Graph Theory","author":"DB West","year":"1996","unstructured":"West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River, NJ (1996)"},{"key":"566_CR32","doi-asserted-by":"crossref","unstructured":"Williams, R.: Faster all-pairs shortest paths via circuit complexity. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 664\u2013673. ACM, New York (2014)","DOI":"10.1145\/2591796.2591811"},{"key":"566_CR33","doi-asserted-by":"crossref","unstructured":"Yen, C.-C., Yeh, M.-Y., Chen, M.-S.: An efficient approach to updating closeness centrality and average path length in dynamic networks. In: 2013 IEEE 13th International Conference on Data Mining, pp. 867\u2013876. IEEE, New York (2013)","DOI":"10.1109\/ICDM.2013.135"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00566-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00566-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00566-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T23:15:52Z","timestamp":1598483752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00566-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,28]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["566"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00566-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,28]]},"assertion":[{"value":"13 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}