{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:54:57Z","timestamp":1767916497147,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8082,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0022-0000(91)90004-o","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"288-306","source":"Crossref","is-referenced-by-count":29,"title":["Improved algorithms for graph four- connectivity"],"prefix":"10.1016","volume":"42","author":[{"given":"Arkady","family":"Kanevsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0022-0000(91)90004-O_BIB1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(82)90046-1","article-title":"A probabilistic algorithm for vertex connectivity of graphs","volume":"15","author":"Becker","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(91)90004-O_BIB2","series-title":"Proceedings, 27th IEEE Ann. Symp. on Foundations of Comp. Sci.","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1016\/0022-0000(91)90004-O_BIB3","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0022-0000(91)90004-O_BIB4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0204034","article-title":"An algorithm for determining whether the connectivity of a graph is at least k","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(91)90004-O_BIB5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flow and testing graph connectivity","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(91)90004-O_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0209016","article-title":"Finding the vertex connectivity of graphs","volume":"9","author":"Galil","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(91)90004-O_BIB7","article-title":"On Finding the Vertex Connectivity of Graphs","author":"Girkar","year":"1987"},{"key":"10.1016\/0022-0000(91)90004-O_BIB8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(91)90004-O_BIB9","article-title":"On the Number of Minimum Size Separating Vertex Sets in a Graph","author":"Kanevsky","year":"1987"},{"key":"10.1016\/0022-0000(91)90004-O_BIB10","series-title":"Proceedings, 28th Ann. IEEE Symp. on Foundations of Comp. Sci.","first-page":"252","article-title":"Improved algorithms for graph four-connectivity","author":"Kanevsky","year":"1987"},{"key":"10.1016\/0022-0000(91)90004-O_BIB11","first-page":"869","article-title":"Parallel algorithms for shared memory machines","author":"Karp","year":"1990"},{"key":"10.1016\/0022-0000(91)90004-O_BIB12","series-title":"Proceedings, 27th IEEE Ann. Symp. on Foundations of Comp. Sci.","first-page":"39","article-title":"A physical interpretation of graph connectivity, and its algorithm applications","author":"Linial","year":"1986"},{"key":"10.1016\/0022-0000(91)90004-O_BIB13","series-title":"Proceedings 26th IEEE Ann. Symp. on Foundations of Comp. Sci.","first-page":"464","article-title":"Computing ears and branchings in parallel","author":"Lovasz","year":"1985"},{"key":"10.1016\/0022-0000(91)90004-O_BIB14","series-title":"Proceedings, 28th IEEE Ann. Symp. on Foundations of Comp. Sci.","first-page":"252","article-title":"Determining edge connectivity in O(nm)","author":"Matula","year":"1987"},{"key":"10.1016\/0022-0000(91)90004-O_BIB15","series-title":"VLSI Algorithms and Architectures","first-page":"34","article-title":"Parallel ear decomposition search (EDS) and st-numbering in graphs","volume":"Vol. 277","author":"Maon","year":"1986"},{"key":"10.1016\/0022-0000(91)90004-O_BIB16","series-title":"Efficient parallel ear decomposition with applications","author":"Miller","year":"1986"},{"key":"10.1016\/0022-0000(91)90004-O_BIB17","series-title":"Proceedings, 19th ACM Ann. Symp. on Theory of Computing","first-page":"335","article-title":"A new graph triconnectivity algorithm and its parallelization","author":"Miller","year":"1987"},{"key":"10.1016\/0022-0000(91)90004-O_BIB18","first-page":"33","article-title":"Efficient parallel triconnectivity in logarithmic time,","volume":"Vol. 319","author":"Ramachandran","year":"1988"},{"key":"10.1016\/0022-0000(91)90004-O_BIB19","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(91)90004-O_BIB20","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(91)90004-O_BIB21","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","article-title":"Non-separable and planar graphs","volume":"34","author":"Whitney","year":"1932","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(91)90004-O_BIB22","series-title":"ICALP 89","first-page":"379","article-title":"Finding triconnected components by local replacements","volume":"Vol. 372","author":"Fussell","year":"1989"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190004O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190004O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:56:19Z","timestamp":1550307379000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009190004O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["002200009190004O"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(91)90004-o","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}