{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T09:06:24Z","timestamp":1787389584399,"version":"build-2736575974"},"reference-count":23,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1993,6]]},"abstract":"<jats:p>A parallel algorithm for finding triconnected components on a CRCW PRAM is presented. The time complexity of the algorithm is $O(\\log n)$, and the processor-time product is $O((m + n)\\log \\log n)$, where n is the number of vertices and m is the number of edges of the input graph. The algorithm, like other parallel algorithms for this problem, is based on open ear decomposition, but it uses a new technique, local replacement, to improve the complexity. Only the need to use the subroutines for connected components and integer sorting, for which no optimal parallel algorithm that runs in $O(\\log n)$ time is known, prevents the algorithm from achieving optimality.<\/jats:p>","DOI":"10.1137\/0222040","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:38:56Z","timestamp":1109227136000},"page":"587-616","source":"Crossref","is-referenced-by-count":20,"title":["Finding Triconnected Components by Local Replacement"],"prefix":"10.1137","volume":"22","author":[{"given":"Donald","family":"Fussell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramakrishna","family":"Thurimella","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","unstructured":"N. Alon and, B. Schieber,  Optimal preprocessing for answering on-line queries, Tech. Rep., 71\/87, Tel Aviv University, Tel Aviv, Israel,  1987"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, R. Thurimella,  Algorithms for parallel\n                      k\n                      -vertex connectivity and sparse certificates,  Proc. 23rd Annual ACM Symposium on Theory of Computing,  1991,  391\u2013401","DOI":"10.1145\/103418.103460"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90019-X"},{"key":"R4","volume-title":"Graph algorithms","author":"Even Shimon","year":"1979"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0040383"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035771"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"H. N. Gabow,  A matroid approach to finding edge connectivity and packing arborescences,  Proc. 23rd Annual ACM Symposium on Theory of Computing,  1991,  112\u2013122","DOI":"10.1145\/103418.103436"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90062-9"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0211024"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90004-O"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90153-2"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/0220070"},{"key":"R15","unstructured":"G. L. Miller, V. Ramachandran,  Efficient parallel ear decomposition with applications,  1986, Manuscript, MSRI, Berkeley, CA, January"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1016\/0891-5849(92)90058-O"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758778"},{"key":"R18","unstructured":"V. Ramachandran,  Parallel open ear decomposition and its application to graph biconnectivity and triconnectivity, Synthesis of Parallel Algorithms, J. H. Reif ed., Morgan-Kaufmann, to appear"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0040371"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0217079"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1137\/0214061"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.3138\/9781487584863"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1932-1501641-2"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0222040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:55:33Z","timestamp":1787338533000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0222040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["10.1137\/0222040"],"URL":"https:\/\/doi.org\/10.1137\/0222040","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}