{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:37:18Z","timestamp":1648766238332},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1016\/0020-0190(83)90112-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"269-272","source":"Crossref","is-referenced-by-count":8,"title":["A general program scheme for finding bridges"],"prefix":"10.1016","volume":"17","author":[{"given":"Yung H.","family":"Tsin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis Y.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90112-6_BIB1","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0020-0190(83)90112-6_BIB2","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(83)90112-6_BIB3","first-page":"308","article-title":"A linear time algorithm for the lowest common ancestors problem","author":"Harel","year":"1980","journal-title":"IEEE 21th Annual Symp. on the Foundations of Computer Science"},{"key":"10.1016\/0020-0190(83)90112-6_BIB4","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0020-0190(83)90112-6_BIB5","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/TC.1973.5009159","article-title":"A parallel algorithm for the efficient solution of a general glass of recurrence equations","volume":"C-22","author":"Kogge","year":"1973","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0020-0190(83)90112-6_BIB6","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0210051","article-title":"Fast efficient parallel algorithms for some graph problems","volume":"10","author":"Savage","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0020-0190(83)90112-6_BIB7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","article-title":"A note on finding the bridges of a graph","volume":"2","author":"Tarjan","year":"1974","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(83)90112-6_BIB8","author":"Tsin","year":"1982","journal-title":"Efficient parallel algorithms for a class of graph theoretic problems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083901126?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083901126?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:57:03Z","timestamp":1555088223000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083901126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0020019083901126"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90112-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}