{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:48:48Z","timestamp":1744901328179,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334597"},{"type":"electronic","value":"9783642334603"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33460-3_35","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T06:18:14Z","timestamp":1347085094000},"page":"458-473","source":"Crossref","is-referenced-by-count":18,"title":["CC-MR\u00a0\u2013 Finding Connected Components in Huge Graphs with MapReduce"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Seidl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brigitte","family":"Boden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergej","family":"Fries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45417-9_39","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"L. Bus","year":"2001","unstructured":"Bus, L., Tvrd\u00edk, P.: A Parallel Algorithm for Connected Components on Distributed Memory Machines. In: Cotronis, Y., Dongarra, J. (eds.) PVM\/MPI 2001. LNCS, vol.\u00a02131, pp. 280\u2013287. Springer, Heidelberg (2001)"},{"issue":"9","key":"35_CR2","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1145\/358628.358650","volume":"25","author":"F.Y.L. Chin","year":"1982","unstructured":"Chin, F.Y.L., Lam, J., Chen, I.-N.: Efficient parallel algorithms for some graph problems. Commun. ACM\u00a025(9), 659\u2013665 (1982)","journal-title":"Commun. ACM"},{"issue":"4","key":"35_CR3","doi-asserted-by":"publisher","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. Computing in Science and Engineering\u00a011(4), 29\u201341 (2009)","journal-title":"Computing in Science and Engineering"},{"key":"35_CR4","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. In: OSDI, pp. 137\u2013150 (2004)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Greiner, J.: A comparison of parallel algorithms for connected components. In: SPAA, pp. 16\u201325 (1994)","DOI":"10.1145\/181014.181021"},{"issue":"8","key":"35_CR6","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/359138.359141","volume":"22","author":"D.S. Hirschberg","year":"1979","unstructured":"Hirschberg, D.S., Chandra, A.K., Sarwate, D.V.: Computing connected components on parallel computers. Commun. ACM\u00a022(8), 461\u2013464 (1979)","journal-title":"Commun. ACM"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: Pegasus: A peta-scale graph mining system. In: ICDM, pp. 229\u2013238 (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"35_CR8","first-page":"1","volume":"30","author":"A. Krishnamurthy","year":"1997","unstructured":"Krishnamurthy, A., Lumetta, S., Culler, D., Yelick, K.: Connected components on distributed memory machines. DIMACS Implementation Challenge\u00a030, 1 (1997)","journal-title":"DIMACS Implementation Challenge"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Lattanzi, S., Moseley, B., Suri, S., Vassilvitskii, S.: Filtering: a method for solving graph problems in mapreduce. In: SPAA, pp. 85\u201394 (2011)","DOI":"10.1145\/1989493.1989505"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Rastogi, V., Machanavajjhala, A., Chitnis, L., Sarma, A.D.: Finding connected components on map-reduce in logarithmic rounds. Computing Research Repository (CoRR), abs\/1203.5387 (2012)","DOI":"10.1109\/ICDE.2013.6544813"},{"issue":"1","key":"35_CR11","doi-asserted-by":"publisher","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(log n) parallel connectivity algorithm. J. Algorithms\u00a03(1), 57\u201367 (1982)","journal-title":"J. Algorithms"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Wu, B., Du, Y.: Cloud-based connected component algorithm. In: Artificial Intelligence and Computational Intelligence (AICI), vol.\u00a03, pp. 122\u2013126 (2010)","DOI":"10.1109\/AICI.2010.360"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33460-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T01:47:43Z","timestamp":1744076863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33460-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334597","9783642334603"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33460-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}