{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:23:50Z","timestamp":1726406630894},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_49","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:32:20Z","timestamp":1330201940000},"page":"262-267","source":"Crossref","is-referenced-by-count":0,"title":["A simple systolic method to find all bridges of an undirected graph"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Schimmler","sequence":"first","affiliation":[]},{"given":"Heiko","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/828.322449","volume":"31","author":"M. J. Atallah","year":"1984","unstructured":"M. J. Atallah, S. R. Kosaraju, Graph Problems on a Mesh-Connected Processor Array, JACM, Vol 31, No 3, July 1984, 649\u2013667.","journal-title":"JACM"},{"key":"18_CR2","unstructured":"L. J. Guibas, H. T. Kung, C. D. Thompson, Direct VLSI Implementation of Combinatorial Algorithms, In Proc. Caltec Conf. on VLSI, 1979, 509\u2013525."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"H.-W. Lang, Transitive Closure on an Instruction Systolic Array, to appear in Proc. Int. Conf. on Systolic Arrays, San Diego, California, May 1988.","DOI":"10.1109\/ARRAYS.1988.18070"},{"volume-title":"Computational Aspects of VLSI","year":"1984","author":"J. D. Ullman","key":"18_CR4","unstructured":"J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0167-8191(88)90005-1","volume":"6","author":"M. Zubair","year":"1988","unstructured":"M. Zubair, B. B. Madan, Efficient Systolic Algorithm for Finding Bridges in a Connected Graph, Parallel Computing, 6, 1988, 57\u201361","journal-title":"Parallel Computing"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:10Z","timestamp":1619571430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}
