{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:57:00Z","timestamp":1725559020088},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_40","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"468-479","source":"Crossref","is-referenced-by-count":10,"title":["External Connected Components"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-68530-8_28","volume-title":"Algorithms - ESA \u201998","author":"J. Abello","year":"1998","unstructured":"Abello, J., Buchsbaum, A.L., Westbrook, J.R.: A Functional Approach to External Graph Algorithms. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 332\u2013343. Springer, Heidelberg (1998) ;Full version AT & T Research Report ,TR 99.1.1 (1999)"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/BF01759076","volume":"6","author":"R.J. Anderson","year":"1991","unstructured":"Anderson, R.J., Miller, G.L.: Deterministic Parallel List Ranking. Algorithmica\u00a06, 859\u2013868 (1991)","journal-title":"Algorithmica"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-44985-X_37","volume-title":"Algorithm Theory - SWAT 2000","author":"L. Arge","year":"2000","unstructured":"Arge, L., Brodal, G., Toma, L.: On External Memory MST, SSSP and Multi-Way Planar Graph Separation. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 433\u2013447. Springer, Heidelberg (2000)"},{"key":"40_CR4","unstructured":"Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-Memory Graph Algorithms. In: Proc. 6th Symposium on Discrete Algorithms, pp. 139\u2013149. ACM-SIAM (1995)"},{"issue":"9","key":"40_CR5","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1145\/358628.358650","volume":"25","author":"F.Y. Chin","year":"1982","unstructured":"Chin, F.Y., Lam, J., Chen, I.: \u2018Efficient Parallel Algorithms for some Graph Problems,\u2019. Communications of the ACM\u00a025(9), 659\u2013665 (1982)","journal-title":"Communications of the ACM"},{"key":"40_CR6","unstructured":"Crauser, A., Mehlhorn, K.: Lecture notes on algorithms for very large data sets (1997) ,\n                    \n                      http:\/\/www.mpi-sb.mpg.de\/~crauser\/courses.html"},{"issue":"8","key":"40_CR7","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.: \u2018Computing Connected Components on Parallel Computers,\u2019. Communications of the ACM\u00a022(8), 461\u2013464 (1979)","journal-title":"Communications of the ACM"},{"issue":"2","key":"40_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/201019.201022","volume":"42","author":"D.R. Karger","year":"1995","unstructured":"Karger, D.R., Klein, P.N., Tarjan, R.E.: A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM\u00a042(2), 321\u2013328 (1995)","journal-title":"Journal of the ACM"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms for Memory Hierarchies","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625. Springer, Heidelberg (2003)"},{"key":"40_CR10","unstructured":"Munagala, K., Ranade, A.: I\/O-Complexity of Graph Algorithms. In: 10th Symposium on Discrete Algorithms, pp. 687\u2013694. ACM-SIAM (1999)"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. 6th Conference on High Performance Computing","author":"J.F. Sibeyn","year":"1999","unstructured":"Sibeyn, J.F.: Ultimate Parallel List Ranking? In: Proc. 6th Conference on High Performance Computing. LNCS, Springer, Heidelberg (1999) ;Full version Techn. Rep. MPII- 99-1005, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (1999)"},{"issue":"2","key":"40_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys\u00a033(2), 209\u2013271 (2001)","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:12Z","timestamp":1620012432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}