{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:35Z","timestamp":1725467915399},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040383","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"149-159","source":"Crossref","is-referenced-by-count":4,"title":["Separation pair detection"],"prefix":"10.1007","author":[{"given":"Donald","family":"Fussell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramakrishna","family":"Thurimella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Komlos and E. Szemeredi, \u201cAn O(n log n) sorting network,\u201d Combinatorica 3:1, 1983, pp. 1\u201319.","journal-title":"Combinatorica"},{"key":"16_CR2","unstructured":"D. Fussell and R. Thurimella, \u201cFinding a sparse graph that preserves biconnectivity,\u201d manuscript."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"G.L. Miller and V. Ramachandran, \u201cA new triconnectivity algorithm and its applications,\u201d Proc. 19th annual STOC, NY, May 1987, pp. 335\u2013344.","DOI":"10.1145\/28395.28431"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-16766-8_4","volume":"227","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber and U. Vishkin, \u201cParallel ear decomposition search (EDS) and ST-numbering in graphs,\u201d VLSI Algorithms and Architectures, Lecture Notes in Computer Science Vol. 227, 1986, pp. 34\u201345.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR5","first-page":"57","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, \u201cAn O(log n) parallel connectivity algorithm,\u201d J. Algorithms 2, (1981), pp. 57\u201363.","journal-title":"J. Algorithms"},{"key":"16_CR6","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"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040383.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:40:16Z","timestamp":1607550016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0040383","relation":{},"subject":[]}}