{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:49:47Z","timestamp":1744901387521,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,12,23]],"date-time":"2016-12-23T00:00:00Z","timestamp":1482451200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10586-016-0713-3","type":"journal-article","created":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T03:46:25Z","timestamp":1482551185000},"page":"2563-2574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Connected components of big graphs in fixed MapReduce rounds"],"prefix":"10.1007","volume":"20","author":[{"given":"Reihane","family":"Abdolazimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3296-8505","authenticated-orcid":false,"given":"Hassan","family":"Naderi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoud","family":"Sagharichian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,23]]},"reference":[{"key":"713_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and Mining Graph Data","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal, C.C., Wang, H.: Managing and Mining Graph Data. Springer, Beijing (2010)"},{"doi-asserted-by":"crossref","unstructured":"Berry, J., Oster, M., Phillips, C.A., Plimpton, S., Shead, T.M.: \u201cMaintaining connected components for infinite graph streams. In: Proceedings of the 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, pp. 95\u2013102 (2013)","key":"713_CR2","DOI":"10.1145\/2501221.2501234"},{"doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: \u201cPegasus: A peta-scale graph mining system implementation and observations. In: ICDM\u201809, Ninth IEEE International Conference on Data Mining, pp. 229\u2013238 (2009)","key":"713_CR3","DOI":"10.1109\/ICDM.2009.14"},{"issue":"2","key":"713_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s13222-014-0154-1","volume":"14","author":"L Kolb","year":"2014","unstructured":"Kolb, L., Sehili, Z., Rahm, E.: Iterative computation of connected graph components with MapReduce. Datenbank-Spektrum 14(2), 107\u2013117 (2014)","journal-title":"Datenbank-Spektrum"},{"key":"713_CR5","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/978-3-642-33460-3_35","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T Seidl","year":"2012","unstructured":"Seidl, T., Boden, B., Fries, S.: Cc-mr\u2013finding connected components in huge graphs with mapreduce. In: Daelemans, W. (ed.) Machine Learning and Knowledge Discovery in Databases, pp. 458\u2013473. Springer, Antwerp (2012)"},{"issue":"4","key":"713_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen, J.: Graph twiddling in a MapReduce world. Comput. Sci. Eng. 11(4), 29\u201341 (2009)","journal-title":"Comput. Sci. Eng."},{"doi-asserted-by":"crossref","unstructured":"Rastogi, V., Machanavajjhala, A., Chitnis, L., Das Sarma, A.: Finding connected components in map-reduce in logarithmic rounds. In: IEEE 29th International Conference on Data Engineering (ICDE), pp. 50\u201361 (2013)","key":"713_CR7","DOI":"10.1109\/ICDE.2013.6544813"},{"key":"713_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058452","volume-title":"Mining of Massive Datasets","author":"A Rajaraman","year":"2011","unstructured":"Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press, New York (2011)"},{"key":"713_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"713_CR10","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","volume":"22","author":"DS Hirschberg","year":"1979","unstructured":"Hirschberg, D.S., Chandra, A.K., Sarwate, D.V.: Computing connected components on parallel computers. Commun. ACM 22(8), 461\u2013464 (1979)","journal-title":"Commun. ACM"},{"issue":"4","key":"713_CR11","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/BF02939544","volume":"8","author":"J Ma","year":"1993","unstructured":"Ma, J., Ma, S.: Efficient parallel algorithms for some graph theory problems. J. Comput. Sci. Technol. 8(4), 362\u2013366 (1993)","journal-title":"J. Comput. Sci. Technol."},{"issue":"1","key":"713_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y Shiloach","year":"1982","unstructured":"Shiloach, Y., Vishkin, U.: An O (logn) parallel connectivity algorithm. J. Algorithms 3(1), 57\u201367 (1982)","journal-title":"J. Algorithms"},{"issue":"6","key":"713_CR13","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1137\/0220066","volume":"20","author":"H Gazit","year":"1991","unstructured":"Gazit, H.: An optimal randomized parallel algorithm for finding connected components in a graph. SIAM J. Comput. 20(6), 1046\u20131067 (1991)","journal-title":"SIAM J. Comput."},{"key":"713_CR14","first-page":"1","volume":"30","author":"A Krishnamurthy","year":"1997","unstructured":"Krishnamurthy, A., Lumetta, S., Culler, D.E., Yelick, K.: Connected components on distributed memory machines. Third DIMACS Implement. Chall. 30, 1\u201321 (1997)","journal-title":"Third DIMACS Implement. Chall."},{"doi-asserted-by":"crossref","unstructured":"Reif, J.H.: An optimal parallel algorithm for integer sorting. In: 26th Annual Symposium on Foundations of Computer Science, pp. 496\u2013504 (1985)","key":"713_CR15","DOI":"10.1109\/SFCS.1985.9"},{"issue":"2","key":"713_CR16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1006\/jcss.1997.1291","volume":"54","author":"DB Johnson","year":"1999","unstructured":"Johnson, D.B., Metaxas, P.: Connected Components inO (log 3\/2 n) Parallel Time for the CREW PRAM. J. Comput. Syst. Sci. 54(2), 227\u2013242 (1999)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Karger, D.R., Nisan, N., Parnas, M.: Fast connected components algorithms for the EREW PRAM. In: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, pp. 373\u2013381 (1992)","key":"713_CR17","DOI":"10.1145\/140901.141920"},{"doi-asserted-by":"crossref","unstructured":"Greiner, J.: A comparison of parallel algorithms for connected components. In: Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 16\u201325 (1994)","key":"713_CR18","DOI":"10.1145\/181014.181021"},{"key":"713_CR19","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-45417-9_39","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface SE\u201439","author":"L Bu\u0161","year":"2001","unstructured":"Bu\u0161, L., Tvrd\u00edk, P.: A parallel algorithm for connected components on distributed memory machines. In: Cotronis, Y., Dongarra, J. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface SE\u201439, vol. 2131, pp. 280\u2013287. Springer, Berlin (2001)"},{"doi-asserted-by":"crossref","unstructured":"Wu, B., Du, Y.: Cloud-based connected component algorithm. In: International Conference on Artificial Intelligence and Computational Intelligence (AICI), pp. 122\u2013126 (2010)","key":"713_CR20","DOI":"10.1109\/AICI.2010.360"},{"key":"713_CR21","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.parco.2011.02.004","volume":"37","author":"SJ Plimpton","year":"2011","unstructured":"Plimpton, S.J., Devine, K.D.: MapReduce in MPI for large-scale graph algorithms. Parallel Comput. 37, 610\u2013632 (2011)","journal-title":"Parallel Comput."},{"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 (2010)","key":"713_CR22","DOI":"10.1145\/1807167.1807184"},{"issue":"17","key":"713_CR23","doi-asserted-by":"crossref","first-page":"4954","DOI":"10.1002\/cpe.3482","volume":"22","author":"M Sagharichian","year":"2015","unstructured":"Sagharichian, M., Naderi, H., Haghjoo, M.: ExPregel: a new computational model for large-scale graph processing. Concurr. Comput. Pract. Exp. 22(17), 4954\u20134969 (2015)","journal-title":"Concurr. Comput. Pract. Exp."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-016-0713-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0713-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0713-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T18:16:06Z","timestamp":1568657766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-016-0713-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,23]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["713"],"URL":"https:\/\/doi.org\/10.1007\/s10586-016-0713-3","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2016,12,23]]}}}