{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T16:16:49Z","timestamp":1772468209412,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":5464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0304-3975(98)00023-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"253-269","source":"Crossref","is-referenced-by-count":6,"title":["On mixed connectivity certificates"],"prefix":"10.1016","volume":"203","author":[{"given":"Shimon","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gene","family":"Itkis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00023-1_BIB1","first-page":"514","article-title":"Network synchronization with polylogarithmic overhead","author":"Awerbuch","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(98)00023-1_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/0222013","article-title":"Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity","volume":"22","author":"Cheriyan","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00023-1_BIB3","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","article-title":"Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs","volume":"9","author":"Cheriyan","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(98)00023-1_BIB4","first-page":"215","article-title":"On the Max-Flow Min-Cut Theorem of networks, Linear Inequalities and Related Systems","volume":"vol. 38","author":"Dantzig","year":"1956"},{"key":"10.1016\/S0304-3975(98)00023-1_BIB5","first-page":"60","article-title":"Sparsification \u2014 a technique for speeding up dynamic algorithms","author":"Eppstein","year":"1992"},{"issue":"3","key":"10.1016\/S0304-3975(98)00023-1_BIB6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/jgt.3190170302","article-title":"On sparse subgraphs preserving connectivity properties","volume":"17","author":"Frank","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(98)00023-1_BIB7","first-page":"112","article-title":"A matroid approach to finding edge connectivity and packing arborescences","author":"Gabow","year":"1991"},{"key":"10.1016\/S0304-3975(98)00023-1_BIB8","first-page":"198","article-title":"Computers and Intractability, a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/S0304-3975(98)00023-1_BIB9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0890-5401(88)90016-8","article-title":"The multi-tree approach to reliability in distributed networks","volume":"79","author":"Itai","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(98)00023-1_BIB10","series-title":"Connectivity certificates made simple and general","author":"Itkis","year":"1996"},{"key":"10.1016\/S0304-3975(98)00023-1_BIB11","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/BF01304933","article-title":"\u00dcber minimal n-fach zusammenh\u00e4ngende, unendliche Graphen und ein Extremalproblem","volume":"23","author":"Mader","year":"1972","journal-title":"Arch. Mat."},{"key":"10.1016\/S0304-3975(98)00023-1_BIB12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01432512","article-title":"Grad und lokaler Zusammenhang in endlichen Graphen","volume":"205","author":"Mader","year":"1973","journal-title":"Math. Ann."},{"key":"10.1016\/S0304-3975(98)00023-1_BIB13","series-title":"Surveys on Combinatorics","first-page":"293","article-title":"Connectivity and edge-connectivity in finite graphs","volume":"vol. 38","author":"Mader","year":"1979"},{"key":"10.1016\/S0304-3975(98)00023-1_BIB14","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","article-title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph","volume":"7","author":"Nagamochi","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(98)00023-1_BIB15","doi-asserted-by":"crossref","unstructured":"R. Thurimella, Sub-linear distributed algorithms for sparse certificates and biconnected components, Proc. 14th ACM Symp. on Principles of Distributed Computing (PODC'95), pp. 28\u201337.","DOI":"10.1145\/224964.224968"},{"key":"10.1016\/S0304-3975(98)00023-1_BIB16","first-page":"104","article-title":"Theory of Finite Graphs","author":"Zykov","year":"1969"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000231?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:50:27Z","timestamp":1555375827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0304397598000231"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00023-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}