{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:52:29Z","timestamp":1761807149015},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1007\/bf01191205","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:10:38Z","timestamp":1108725038000},"page":"53-76","source":"Crossref","is-referenced-by-count":36,"title":["A new graph triconnectivity algorithm and its parallelization"],"prefix":"10.1007","volume":"12","author":[{"given":"Gary L.","family":"Miller","sequence":"first","affiliation":[]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole: Parallel merge sort,SIAM J. Comput. 17 (1988), 770?785.","journal-title":"SIAM J. Comput."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"R. Cole, U. Vishkin: Approximate and exact parallel scheduling with applications to list, tree and graph problems,Proc. 27th Ann. IEEE Symp. on Foundations of Comp. Sci. 1986, 478?491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"CR3","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even:Graph Algorithms, Computer Science Press, Rockville, MD, 1979."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft, R. E. Tarjan: Dividing a graph into triconnected components,SIAM J. Comput. 2 (1973), 135?158.","journal-title":"SIAM J. Comput."},{"key":"CR5","volume-title":"Finding the triconnected components of a graph, TR 72-140","author":"J. E. Hopcroft","year":"1972","unstructured":"J. E. Hopcroft, R. E. Tarjan: Finding the triconnected components of a graph, TR 72-140, Computer Science Department, Cornell University, Ithaca, NY, 1972."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/0211024","volume":"11","author":"J. Ja'Ja","year":"1982","unstructured":"J. Ja'Ja, J. Simon: Parallel algorithms in graph theory: planarity testing,SIAM J. Comput. 11 (1982), 314?328.","journal-title":"SIAM J. Comput."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(91)90004-O","volume":"42","author":"A. Kanevsky","year":"1991","unstructured":"A. Kanevsky, V. Ramachandran: Improved algorithms for graph four-connectivity,Jour. Comput. Syst. Sci. 42 (1991), 288?306.","journal-title":"Jour. Comput. Syst. Sci."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"R. M. Karp, V. Ramachandran: Parallel algorithms for shared memory machines,Handbook of Theoretical Computer Science, J. Van Leeuwen, ed., North Holland, 1990, 869?941.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"L. Lov\ufffdsz: Computing ears and branchings in parallel,Proc. 26th IEEE Ann. Symp. on Foundations of Comp. Sci. 1985, 464?467.","DOI":"10.1109\/SFCS.1985.16"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","volume":"47","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber, U. Vishkin: Parallel ear decomposition search (EDS) and st-numbering in graphs,Theoretical Comput. Sci. 47 (1986), 277?298.","journal-title":"Theoretical Comput. Sci."},{"key":"CR11","volume-title":"Efficient parallel ear decomposition with applications, unpublished manuscript","author":"G. L. Miller","year":"1986","unstructured":"G. L. Miller, V. Ramachandran: Efficient parallel ear decomposition with applications, unpublished manuscript, MSRI, Berkeley, CA, January 1986."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"G. L. Miller, V. Ramachandran: A new graph triconnectivity algorithm and its parallelization,Proc. 19th Annual ACM Symp. on Theory of Computing, 1987, 254?263.","DOI":"10.1145\/28395.28431"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"G. L. Miller, J. H. Reif: Parallel tree contraction and its applications,Proc. 26th IEEE Symp. on Foundations of Comp. Sci., 1985, 478?489.","DOI":"10.1109\/SFCS.1985.43"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BFb0040371","volume":"319","author":"V. Ramachandran","year":"1988","unstructured":"V. Ramachandran, U. Vishkin: Efficient parallel triconnectivity in logarithmic time,VLSI Algorithms and Architectures, Springer Verlag LNCS319 (1988), 33?42.","journal-title":"VLSI Algorithms and Architectures"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan, U. Vishkin: Finding biconnected components and computing tree functions in logarithmic parallel time,SIAM J. Comput. 14 (1985), 862?874.","journal-title":"SIAM J. Comput."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"W. T. Tutte:Connectivity in Graphs, University of Toronto Press, 1966.","DOI":"10.3138\/9781487584863"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"H. Whitney: Non-separable and planar graphs,Trans. Amer. Math. Soc. 34 (1932), 339?362.","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191205.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01191205\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:52:10Z","timestamp":1586119930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01191205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["BF01191205"],"URL":"https:\/\/doi.org\/10.1007\/bf01191205","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}