{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:24:14Z","timestamp":1742401454849},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":[[1991,6]]},"DOI":"10.1016\/0020-0190(91)90087-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"307-313","source":"Crossref","is-referenced-by-count":2,"title":["Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs"],"prefix":"10.1016","volume":"38","author":[{"given":"Kenneth","family":"Luo","sequence":"first","affiliation":[]},{"given":"William","family":"Klostermeyer","sequence":"additional","affiliation":[]},{"given":"Yuan-Chieh","family":"Chow","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Newman-Wolfe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90087-X_BIB1","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/357360.357365","article-title":"Distributed deadlock detection","author":"Chandy","year":"1983","journal-title":"ACM Trans. Comput. Systems"},{"issue":"2","key":"10.1016\/0020-0190(91)90087-X_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","article-title":"A linear algorithm for the dominating set of a tree","volume":"4","author":"Cockayne","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90087-X_BIB3","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0020-0190(91)90087-X_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(91)90087-X_BIB5","doi-asserted-by":"crossref","DOI":"10.1109\/2.43525","article-title":"Deadlock detection in distributed systems","author":"Singhal","year":"1989","journal-title":"IEEE Computer"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190087X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190087X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:24:39Z","timestamp":1555143879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190087X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["002001909190087X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90087-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}