{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:17Z","timestamp":1759637777828},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0196-6774(82)90020-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"205-217","source":"Crossref","is-referenced-by-count":18,"title":["Robust linear algorithms for cutsets"],"prefix":"10.1016","volume":"3","author":[{"given":"Barry K","family":"Rosen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90020-7_BIB1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/321992.322001","article-title":"Code generation for expressions with common subexpressions","volume":"24","author":"Aho","year":"1977","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/0196-6774(82)90020-7_BIB2","doi-asserted-by":"crossref","DOI":"10.21236\/ADA087996","article-title":"Fundamental Algorithms for Concurrency Control in Distributed Database Systems","author":"Bernstein","year":"1980"},{"key":"10.1016\/0196-6774(82)90020-7_BIB3","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/TSE.1980.230491","article-title":"On deadlock detection in distributed systems","volume":"6","author":"Gligor","year":"1980","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0196-6774(82)90020-7_BIB4","series-title":"Operating Systems","first-page":"394","article-title":"Notes on data base operating systems","author":"Gray","year":"1978"},{"key":"10.1016\/0196-6774(82)90020-7_BIB5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/321832.321835","article-title":"Characterizations of reducible flow graphs","volume":"21","author":"Hecht","year":"1974","journal-title":"J. Assoc. Comput. Math."},{"issue":"9","key":"10.1016\/0196-6774(82)90020-7_BIB6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/MC.1980.1653786","article-title":"The deadlock problem: an overview","volume":"13","author":"Isloor","year":"1980","journal-title":"Computer"},{"key":"10.1016\/0196-6774(82)90020-7_BIB7","series-title":"The Elements of Programming Style","author":"Kernighan","year":"1978"},{"key":"10.1016\/0196-6774(82)90020-7_BIB8","author":"Knuth","year":"1968"},{"key":"10.1016\/0196-6774(82)90020-7_BIB9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/TSE.1980.230476","article-title":"Subsystems of processes with deadlock avoidance","volume":"6","author":"Lomet","year":"1980","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0196-6774(82)90020-7_BIB10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1109\/TSE.1979.234181","article-title":"Locking and deadlock detection in distribution data bases","volume":"5","author":"Menasce","year":"1979","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0196-6774(82)90020-7_BIB11","article-title":"Global Deadlock Detection Algorithm","author":"Obermarck","year":"1980"},{"key":"10.1016\/0196-6774(82)90020-7_BIB12","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0208051","article-title":"A linear time algorithm for finding minimum cutsets in reducible graphs","volume":"8","author":"Shamir","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90020-7_BIB13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1137\/0204025","article-title":"Recursion structure simplification","volume":"4","author":"Strong","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90020-7_BIB14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900207?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900207?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:51:53Z","timestamp":1548744713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0196677482900207"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90020-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}