{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:55:51Z","timestamp":1787507751707,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540513711","type":"print"},{"value":"9783540462019","type":"electronic"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035771","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:00:28Z","timestamp":1133409628000},"page":"379-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Finding triconnected components by local replacements"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, \u201cApproximate and exact parallel scheduling with applications to list, tree, and graph problems,\u201d Proc. 27th Symp. Found. Comp. Sci., 1986, pp. 478\u2013491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"24_CR2","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979."},{"key":"24_CR3","first-page":"149","volume":"319","author":"D. Fussell","year":"1988","unstructured":"D. Fussell and R. Thurimella, \u201cSeparation pair detection,\u201d VLSI Algorithms and Architectures, Springer-Verlag LNCS, vol. 319, 1988, pp. 149\u2013159.","journal-title":"Springer-Verlag LNCS"},{"key":"24_CR4","volume-title":"Finding the triconnected components of a graph","author":"J. E. Hopcroft","year":"1972","unstructured":"J. E. Hopcroft, and R. E. Tarjan, \u201cFinding the triconnected components of a graph,\u201d TR 72\u2013140, Computer Science Department, Cornell University, Ithaca, NY, 1972."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft, and R. E. Tarjan, \u201cDividing a graph into triconnected components,\u201d SIAM J. Computing, vol. 2, 1973, pp. 135\u2013158.","journal-title":"SIAM J. Computing"},{"key":"24_CR6","unstructured":"H. Jung, private communication."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1137\/0211024","volume":"11","author":"J. J\u00e1 J\u00e1","year":"1982","unstructured":"J. J\u00e1 J\u00e1, and J. Simon, \u201cParallel algorithms in Graph theory: Planarity Testing,\u201d SIAM J. Computing, vol. 11, 1982, pp. 314\u2013328.","journal-title":"SIAM J. Computing"},{"key":"24_CR8","unstructured":"R. M. Karp, V. Ramachandran, \u201cA survey of parallel algorithms for shared-memory machines,\u201d Report No. UCB\/CSD 88\/408, University of California, Berkeley, CA, 1988; also, Handbook of Theoretical Computer Science, North-Holland, 1989, to appear."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"G.L. Miller, and J. Reif, \u201cParallel tree contraction and its applications,\u201d Proc. 26th Symp. Found. Comp. Sci., October 1985, pp. 478\u2013489.","DOI":"10.1109\/SFCS.1985.43"},{"key":"24_CR10","volume-title":"Efficient parallel ear decomposition with applications","author":"G.L. Miller","year":"1986","unstructured":"G.L. Miller, and V. Ramachandran, \u201cEfficient parallel ear decomposition with applications,\u201d Manuscript, MSRI, Berkeley, CA, January 1986."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"G.L. Miller, and V. Ramachandran, \u201cA new triconnectivity algorithm and its applications,\u201d Proc. 19th Ann. ACM Symp. on Theory of Computing, May 1987, pp. 335\u2013344.","DOI":"10.1145\/28395.28431"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","volume":"47","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber, and U. Vishkin, \u201cParallel ear decomposition search (EDS) and ST-numbering in graphs,\u201d Theoretical Computer Science, vol. 47, 1986, pp. 277\u2013298.","journal-title":"Theoretical Computer Science"},{"key":"24_CR13","first-page":"33","volume":"319","author":"V. Ramachandran","year":"1988","unstructured":"V. Ramachandran, and U. Vishkin, \u201cEfficient parallel triconnectivity in logarithmic time,\u201d VLSI Algorithms and Architectures, Springer-Verlag LNCS, vol. 319, 1988, pp. 33\u201342.","journal-title":"Springer-Verlag LNCS"},{"key":"24_CR14","first-page":"57","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach, and U. Vishkin, \u201cAn O(log n) parallel connectivity algorithm,\u201d Journal of Algorithms, 2 (1981), pp. 57\u201363.","journal-title":"Journal of Algorithms"},{"key":"24_CR15","first-page":"111","volume":"319","author":"B. Schieber","year":"1988","unstructured":"B. Schieber, U. Vishkin, \u201cOn finding lowest common ancestors: simplification and parallelization,\u201d VLSI Algorithms and Architectures, Springer-Verlag LNCS 319, 1988, pp. 111\u2013123.","journal-title":"Springer-Verlag LNCS"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1984","unstructured":"R. E. Tarjan, and U. Vishkin, \u201cAn efficient parallel biconnectivity algorithm,\u201d SIAM J. Computing, 14 (1984), pp. 862\u2013874.","journal-title":"SIAM J. Computing"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"W. T. Tutte, Connectivity in Graphs, University of Toronto Press, 1966.","DOI":"10.3138\/9781487584863"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:16:01Z","timestamp":1578528961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035771"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0035771","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"29 November 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}