{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:27:37Z","timestamp":1759336057626,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638902"},{"type":"electronic","value":"9783540696629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_23","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T21:12:11Z","timestamp":1270501931000},"page":"202-211","source":"Crossref","is-referenced-by-count":0,"title":["Approximating unweighted connectivity problems in parallel"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/0222013","volume":"22","author":"J. Cheriyan","year":"1993","unstructured":"J. Cheriyan, M.-Y. Kao, and R. Thurimella, Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates, SIAM J. Comput. 22 (1993), 157\u2013174.","journal-title":"SIAM J. Comput."},{"key":"23_CR2","unstructured":"J. Cheriyan and R. Thurimella, Approximating Unweighted k-Connectivity via Matching, FOCS'96."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"K.W. Chong and T.W. Lam, Approximating Biconnectivity in Parallel, SPAA'95, pp. 224\u2013233.","DOI":"10.1145\/215399.215447"},{"key":"23_CR4","unstructured":"K.W. Chong and T.W. Lam, Improving Biconnectivity Approximation via Local Optimization, SODA'96."},{"key":"23_CR5","unstructured":"C.G. Fernandes, A Better Approximation Ratio for the Minimum k-EdgeConnected Spanning Subgraph Problem, SODA'97."},{"key":"23_CR6","unstructured":"N. Garg, V. Santosh, and A. Singla, Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques, SODA'93, pp. 103\u2013111."},{"key":"23_CR7","unstructured":"M. Gr\u00f6tschel, C. Monma, and M. Stoer, Design of Survivable Networks, in: Handbook in Operations Research and Management Science, Volume on Networks, 1993."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","volume":"22","author":"A. Israeli","year":"1986","unstructured":"A. Israeli and Y. Shiloach, An Improved Maximal Matching Parallel Algorithm, IPL 22 (1986) 57\u201360.","journal-title":"IPL"},{"key":"23_CR9","unstructured":"D.R. Karger and R. Motwani, Derandomization through Approximation: An NC Algorithm for Minimum Cuts, STOC'94."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"S. Khuller and B. Raghavachari, Improved Approximation Algorithms for Uniform Connectivity Problems, STOC'95, pp. 1\u201310.","DOI":"10.1145\/225058.225066"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"S. Khuller and B. Schieber, Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs, FOCS'89, pp. 288\u2013293.","DOI":"10.1109\/SFCS.1989.63492"},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"S. Khuller and U. Vishkin, Biconnectivity Approximations and Graph Carvings, JACM 41 (1994) 214\u2013235.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:21:49Z","timestamp":1740000109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}