{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:45:09Z","timestamp":1760586309503},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8994,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0022-0000(88)90009-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"292-311","source":"Crossref","is-referenced-by-count":25,"title":["On locating minimum feedback vertex sets"],"prefix":"10.1016","volume":"37","author":[{"given":"Errol L.","family":"Lloyd","sequence":"first","affiliation":[]},{"given":"Mary Lou","family":"Soffa","sequence":"additional","affiliation":[]},{"given":"Ching-Chy","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0022-0000(88)90009-8_BIB1","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","article-title":"Flow graph reducibility","volume":"1","author":"Hecht","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(88)90009-8_BIB2","series-title":"Proceedings, Sixth Annual Princeton Conference on Information Science and Systems","article-title":"An n log n algorithm for detecting reducible graphs","author":"Hopcroft","year":"1972"},{"key":"10.1016\/0022-0000(88)90009-8_BIB3","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1974"},{"key":"10.1016\/0022-0000(88)90009-8_BIB4","article-title":"A New Algorithm for Finding Small Cycle Cutsets","author":"Levy","year":"1983","journal-title":"IBM Los Angeles Scientific Center Report G3202721"},{"issue":"No. 4","key":"10.1016\/0022-0000(88)90009-8_BIB5","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."},{"issue":"No. 1","key":"10.1016\/0022-0000(88)90009-8_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/TCS.1975.1083961","article-title":"The identification of a minimal feedback vertex set of a directed graph","volume":"CAS-22","author":"Smith","year":"1975","journal-title":"IEEE Trans. Circuits and Systems"},{"issue":"No. 2","key":"10.1016\/0022-0000(88)90009-8_BIB7","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/3149.3159","article-title":"Feedback vertex sets and cyclically reducible graphs","volume":"32","author":"Wang","year":"1985","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000088900098?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000088900098?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:54:29Z","timestamp":1550325269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000088900098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0022000088900098"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(88)90009-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}