{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T02:44:48Z","timestamp":1794365088468,"version":"4.9.0"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,11]]},"abstract":"<jats:p>In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in $O(n + m)$ time and space on a graph of n vertices and m edges. A parallel implementation runs in $O(\\log n)$ time and $O(n + m)$ space using $O(n + m)$ processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in $O(n^2 \/p)$ time and $O(n^2 )$ space using any number $p \\leqq n^2 \/\\log ^2 n$ of processors, on a concurrent-read, exclusive-write parallel RAM. The last algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique that simplifies and improves computation of various functions on trees is introduced. This technique typically requires $O(\\log n)$ time using processors and $O(n)$ space on an exclusive-read exclusive-write parallel RAM.<\/jats:p>","DOI":"10.1137\/0214061","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"862-874","source":"Crossref","is-referenced-by-count":409,"title":["An Efficient Parallel Biconnectivity Algorithm"],"prefix":"10.1137","volume":"14","author":[{"given":"Robert E.","family":"Tarjan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RAIS84","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Israeli, Y. Shiloach,  Finding Euler circuits in logarithmic parallel time,  Proc. Sixteenth ACM Symposium on Theory of Computing,  1984,  249\u2013257","DOI":"10.1145\/800057.808688"},{"key":"RAKS83","doi-asserted-by":"crossref","unstructured":"M. Ajtai, K. Komlos, E. Szemeredi,  An  O(nlogn) sorting network,  Proc. Fifteenth ACM Symposium on Theory of Computing,  1983,  1\u20139","DOI":"10.1145\/800061.808726"},{"key":"RAT84","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90072-3"},{"key":"RAV84","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90003-5"},{"key":"RBE73","volume-title":"Graphs and hypergraphs","author":"Berge Claude","year":"1973"},{"key":"RBH82","doi-asserted-by":"crossref","unstructured":"A. Borodin, J. E. Hopcroft,  Routing, merging and sorting on parallel models of computation,  Proc. Fourteenth ACM Symposium on Theory of Computing,  1982,  334\u2013338","DOI":"10.1145\/800070.802209"},{"key":"RCLC81","unstructured":"F. Y. Chin, J. Lam, I. Chen,  Optimal parallel algorithms for the connected component problem,  Proc. 1981 International Conference on Parallel Processing,  1981,  170\u2013175"},{"key":"REC79A","unstructured":"D. M. Eckstein,  Simultaneous memory access, Technical Report, TR-79-6, Computer Science Department, Iowa State Univ., Ames, Iowa,  1979"},{"key":"REC79B","unstructured":"D. M. Eckstein,  BFS and biconnectivity, Technical Report, TR-79-11, Computer Science Department, Iowa State Univ., Ames, Iowa,  1979"},{"key":"RHA69","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"RHCS79","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359141"},{"key":"RM83","doi-asserted-by":"publisher","DOI":"10.1145\/2157.322410"},{"key":"RRV83","doi-asserted-by":"crossref","unstructured":"J. Reif, L. J. Valiant,  A logarithmic time sort for linear size networks,  Proc. Fifteenth ACM Symposium on Theory of Computing,  1983,  10\u201316","DOI":"10.1145\/800061.808727"},{"key":"RSJ81","doi-asserted-by":"publisher","DOI":"10.1137\/0210051"},{"key":"RSV81","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90010-9"},{"key":"RSV82","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"RTA72","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"RTA74A","doi-asserted-by":"publisher","DOI":"10.1137\/0203006"},{"key":"RTA74B","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(74)90003-9"},{"key":"RTA82","unstructured":"T. E. Tarjan,  Graph partitions defined by simple cycles, Technical Memorandum, AT&T Bell Laboratories, Murray Hill, NJ,  1982"},{"key":"RTC83","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90112-6"},{"key":"RTC84","doi-asserted-by":"publisher","DOI":"10.1137\/0213036"},{"key":"RTH83","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676178"},{"key":"RTS82","unstructured":"Y. H. Tsin,  A generalization of Tarjan's depth first search algorithm for the biconnectivity problem, Dept. Computing Science, Univ. Alberta, Edmonton, Alberta, Canada,  1982"},{"key":"RTV84","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan, U. Vishkin,  Finding biconnected components and computing tree functions in logarithmic parallel time,  Proc. 25th Annual IEEE Symposium on Foundations of Computing,  1984,  12\u201320","DOI":"10.1109\/SFCS.1984.715896"},{"key":"RV81","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90019-2"},{"key":"RV83A","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90033-0"},{"key":"RV83B","unstructured":"U. Vishkin,  O(logn) and optimal parallel biconnectivity algorithms, Technical Report, #69, Computer Science Dept., New York Univ., New York,  1983"},{"key":"RV83C","unstructured":"U. Vishkin,  Synchronous parallel computation\u2013a survey, Technical Report, #71, Computer Science Dept., New York Univ., New York,  1983"},{"key":"RV84","unstructured":"U. Vishkin,  An efficient parallel strong orientation, Technical Report, #109, Computer Science Dept., New York Univ., New York,  1984"},{"key":"RWI75","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321911"},{"key":"RWY79","unstructured":"J. C. Wyllie,  The complexity of parallel computation, Technical Report, TR 79-387, Dept. Computer Science, Cornell Univ., Ithaca, NY,  1979"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:56Z","timestamp":1787337596000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214061"],"URL":"https:\/\/doi.org\/10.1137\/0214061","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}