{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:12Z","timestamp":1725459072316},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540156895"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028804","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T17:15:07Z","timestamp":1138209307000},"page":"208-217","source":"Crossref","is-referenced-by-count":5,"title":["Parallel algorithms for connected components in a graph"],"prefix":"10.1007","author":[{"given":"V\u00e1clav","family":"Koubek","sequence":"first","affiliation":[]},{"given":"Jana","family":"Kr\u0161\u0148\u00e1kov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai,M. \u2014 Koml\u00f3s,J. \u2014 Szemer\u00e9di,E.: An O(n log n) sorting network, Proc. 15.ACM Symp. on Theory of Computing, 1983, 1\u20139.","DOI":"10.1145\/800061.808726"},{"key":"20_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs, North-Holland, Amstedam, 1973"},{"key":"20_CR3","volume-title":"Programming, Games and Transportation Networks","author":"C. Berge","year":"1965","unstructured":"Berge, C. \u2014 Ghonila-Honri, A.: Programming, Games and Transportation Networks, Wiley, New York, 1965"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1145\/358628.358650","volume":"25","author":"F.Y. Chin","year":"1982","unstructured":"Chin, F.Y. \u2014 Lam, J. \u2014 Chen, I.: Optimal parallel algorithms for the connected component problems, Comm. of ACM, 25, (1982), 659\u2013665.","journal-title":"Comm. of ACM"},{"key":"20_CR5","first-page":"1073","volume":"29","author":"L.M. Goldschlager","year":"1982","unstructured":"Goldschlager, L.M.: Synchronous Parallel Computation, Proc. 10th ACM STOC, 1978, 89\u201394, and J. ACM 29, (1982), 1073\u20131086","journal-title":"Proc. 10th ACM STOC, 1978, 89\u201394, and J. ACM"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Hirschberg,D.S.: Parallel algorithm for transitive closure and the connected component problems, Proc. of Eight Annual ACM STOC, 1976, 55\u201357.","DOI":"10.1145\/800113.803631"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","volume":"22","author":"D.S. Hirschberg","year":"1979","unstructured":"Hirschberg, D.S. \u2014 Chandra, A.K. \u2014 Sarvate, D.V.: Computing Connected Components on Parallel Computers, Comm. of ACM, 22, (1979), 461\u2013464.","journal-title":"Comm. of ACM"},{"key":"20_CR8","unstructured":"Koubek,V. \u2014 Kr\u0161\u0148\u00e1kov\u00e1,J.: Parallel algorithms for finding of components of a graph, In: SOFSEM'84, 1984, 326\u2013331 (Czech)"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Ku\u010dera","year":"1982","unstructured":"Ku\u010dera, L.: Parallel computation and conflicts in memory access, Inf. Proc. Letters 14, (1982), 93\u201396.","journal-title":"Inf. Proc. Letters"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"E.R. Ladner","year":"1980","unstructured":"Ladner, E.R. \u2014 Fischer, M.J.: Parallel prefix computation, J. ACM 27, (1980), 831\u2013838","journal-title":"J. ACM"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0022-0000(73)80043-1","volume":"7","author":"I Munro","year":"1973","unstructured":"Munro, I \u2014 Paterson, M.: Optimal algorithms for parallel polynomial evaluation, J. of Comp System Sci 7, 1973, 189\u2013198.","journal-title":"J. of Comp System Sci"},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","volume":"14","author":"D. Nath","year":"1982","unstructured":"Nath, D. \u2014 Maheshwari, S.N: Parallel algorithms for the connected components and minimal spanning tree problems, Inform.Proc.Letters 14, (1982), 7\u201311","journal-title":"Inform.Proc.Letters"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","volume":"7","author":"E. Reghabatti","year":"1978","unstructured":"Reghabatti, E. \u2014 Corneil, D.C.: Parallel computation in graph theory, SIAM J.Comput.7, (1978), 230\u2013237","journal-title":"SIAM J.Comput."},{"key":"20_CR14","unstructured":"Sawage,C.: Fast efficient parallel algorithms for some graph problems, TR 79-08, North Carolina State Univ, 1978"},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0210051","volume":"10","author":"C. Sawage","year":"1981","unstructured":"Sawage, C. \u2014 J\u00e1 J\u00e1, J.: Fast efficient parallel algorithms for some graph problems, SIAM J. Comput 10,(1981), 682\u2013691","journal-title":"SIAM J. Comput"},{"key":"20_CR16","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. \u2014 Vishkin, U.: An 0(log n) parallel connectivity algorithm, J. Algorithms 3, (1982), 57\u201363","journal-title":"J. Algorithms"},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms, SIAM J.Comput 1, (1972), 146\u2013160.","journal-title":"SIAM J.Comput"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Tarjan,R.E. \u2014 Vishkin,U.: Finding biconnected components and computing tree functions in logarithmic parallel time, 25. Annual Symp. of FOCS, 1984, 14\u201320","DOI":"10.1109\/SFCS.1984.715896"},{"key":"20_CR19","unstructured":"Vishkin,U.: Synchronous parallel computation \u2014 survey, Technical Report New York University, 1983"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028804.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:00Z","timestamp":1607551140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540156895"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0028804","relation":{},"subject":[]}}