{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T21:47:06Z","timestamp":1697838426573},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T00:00:00Z","timestamp":1464307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11280-016-0394-0","type":"journal-article","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T11:59:09Z","timestamp":1464350349000},"page":"399-416","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A fast method to exactly calculate the diameter of incremental disconnected graphs"],"prefix":"10.1007","volume":"20","author":[{"given":"Masoud","family":"Sagharichian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Alipour Langouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hassan","family":"Naderi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"key":"394_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Kawata, Y.: An exact algorithm for diameters of large real directed graphs. In: Experimental Algorithms, pp. 56\u201367. Springer (2015)","DOI":"10.1007\/978-3-319-20086-6_5"},{"issue":"3","key":"394_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/945721.945728","volume":"32","author":"M Bawa","year":"2003","unstructured":"Bawa, M., Cooper, B.F., Crespo, A., Daswani, N., Ganesan, P., Garcia-Molina, H., Kamvar, S., Marti, S., Schlosser, M., Sun, Q.: Peer-to-peer research at Stanford. ACM SIGMOD Rec. 32(3), 23\u201328 (2003)","journal-title":"ACM SIGMOD Rec."},{"key":"394_CR3","doi-asserted-by":"crossref","unstructured":"Chechik, S., Larkin, D.H., Roditty, L., Schoenebeck, G., Tarjan, R.E., Williams, V.: Better approximation algorithms for the graph diameter. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1041\u20131052. SIAM (2014)","DOI":"10.1137\/1.9781611973402.78"},{"issue":"4","key":"394_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/aama.2001.0720","volume":"26","author":"F Chung","year":"2001","unstructured":"Chung, F., Lu, L.: The diameter of sparse random graphs. Adv. Appl. Math. 26(4), 257\u2013279 (2001)","journal-title":"Adv. Appl. Math."},{"key":"394_CR5","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2012.09.018","volume":"514","author":"P Crescenzi","year":"2013","unstructured":"Crescenzi, P., Grossi, R., Habib, M., Lanzi, L., Marino, A.: On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. 514, 84\u201395 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"394_CR6","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Grossi, R., Imbrenda, C., Lanzi, L., Marino, A.: Finding the diameter in real-world graphs. In: Algorithms--ESA 2010, pp. 302\u2013313. Springer (2010)","DOI":"10.1007\/978-3-642-15775-2_26"},{"key":"394_CR7","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Grossi, R., Lanzi, L., Marino, A.: On computing the diameter of real-world directed (weighted) graphs. In: Experimental Algorithms, pp. 99\u2013110. Springer (2012)","DOI":"10.1007\/978-3-642-30850-5_10"},{"key":"394_CR8","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Onizuka, M., Kitsuregawa, M.: Real-time diameter monitoring for time-evolving graphs. In: Database Systems for Advanced Applications, pp. 311\u2013325. Springer (2011)","DOI":"10.1007\/978-3-642-20149-3_24"},{"key":"394_CR9","unstructured":"Jure, L., Andrej, K.: SNAP datasets: Stanford large network dataset collection. [Online]. Available: http:\/\/snap.stanford.edu\/data (2014)"},{"issue":"6","key":"394_CR10","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1002\/ett.1013","volume":"15","author":"A Kumar","year":"2004","unstructured":"Kumar, A., Merugu, S., Xu, J.J., Zegura, E.W., Yu, X.: Ulysses: a robust, low-diameter, low-latency peer-to-peer network. Eur. Trans. Telecommun. 15(6), 571\u2013587 (2004)","journal-title":"Eur. Trans. Telecommun."},{"key":"394_CR11","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"17","key":"394_CR12","doi-asserted-by":"crossref","first-page":"4954","DOI":"10.1002\/cpe.3482","volume":"27","author":"S Masoud","year":"2015","unstructured":"Masoud, S., Hassan, N., Mostafa, H.: ExPregel: a new computational model for large-scale graph processing. Concurr. Comput. 27(17), 4954\u20134969 (2015)","journal-title":"Concurr. Comput."},{"issue":"2","key":"394_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"6749","key":"394_CR14","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"A Reka","year":"1999","unstructured":"Reka, A., Hawoong, J., Albert-Laszlo, B.: Internet: Diameter of the world-wide web. Nature 401(6749), 130\u2013131 (1999)","journal-title":"Nature"},{"key":"394_CR15","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 (2013)","DOI":"10.1145\/2488608.2488673"},{"issue":"5","key":"394_CR16","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.comnet.2005.04.016","volume":"50","author":"J Shudong","year":"2006","unstructured":"Shudong, J., Azer, B.: Small-world characteristics of internet topologies and implications on multicast scaling. Comput. Netw. 50(5), 648\u2013666 (2006)","journal-title":"Comput. Netw."},{"key":"394_CR17","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 (2011)","DOI":"10.1145\/2063576.2063748"},{"key":"394_CR18","unstructured":"Walshaw, C.: The university of greenwich gaph partitioning archive. [Online]. Available: http:\/\/staffweb.cms.gre.ac.uk\/~c.walshaw\/partition\/ ( 2000). Accessed 2015"},{"key":"394_CR19","doi-asserted-by":"crossref","unstructured":"Wasserman, S.: Social network analysis Methods and applications. Cambridge University Press (1994)","DOI":"10.1017\/CBO9780511815478"},{"issue":"14","key":"394_CR20","doi-asserted-by":"crossref","first-page":"1981","DOI":"10.14778\/2733085.2733103","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Blogel: A block-centric framework for distributed computation on real-world graphs. Proc. VLDB Endow. 7(14), 1981\u20131992 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"394_CR21","unstructured":"Yuster, R.: Computing the diameter polynomially faster than APSP. arXiv preprint arXiv:1011.6181 (2010)"},{"key":"394_CR22","doi-asserted-by":"crossref","unstructured":"Zwick, U.: Exact and approximate distances in graphs\u2014a survey. In: Algorithms\u2014ESA 2001, pp. 33\u201348. Springer (2001)","DOI":"10.1007\/3-540-44676-1_3"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0394-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-016-0394-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0394-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0394-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T23:48:22Z","timestamp":1567986502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-016-0394-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,27]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["394"],"URL":"https:\/\/doi.org\/10.1007\/s11280-016-0394-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,27]]}}}