{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T03:27:32Z","timestamp":1771126052904,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(00)00339-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:52:51Z","timestamp":1027583571000},"page":"253-265","source":"Crossref","is-referenced-by-count":55,"title":["On enumerating all minimal solutions of feedback problems"],"prefix":"10.1016","volume":"117","author":[{"given":"Benno","family":"Schwikowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewald","family":"Speckenmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00339-5_BIB1","doi-asserted-by":"crossref","unstructured":"M. Bidjan-Irani, U. Gl\u00e4sser, F. Rammig, Knowledge based tools for testability checking, in: Proceedings of the third International Conference on Fault-Tolerant Computing Systems, September 1987.","DOI":"10.1007\/978-3-642-45628-2_11"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB2","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/TCT.1972.1083540","article-title":"A note on minimal and quasi-minimal essential sets in complex directed graphs","volume":"19","author":"Diaz","year":"1972","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB3","doi-asserted-by":"crossref","unstructured":"R. Floyd, Assigning meaning to programs, in: Proceedings of Symposium on Applied Mathematics, American Mathematical Society, 1967, pp. 19\u201332.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB4","doi-asserted-by":"crossref","unstructured":"E. Fredkin, Trie memory, Comm. ACM 3 (1960) 490\u2013499.","DOI":"10.1145\/367390.367400"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB5","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1137\/0217034","article-title":"A graph theoretic approach to statistical data security","volume":"17","author":"Gusfield","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB6","unstructured":"D.S. Hochbaum, Various Notions of Approximations: Good, Better, Best and More, PWS Publishing, Boston, MA, 1995, p. 350. (Chapter 9)."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets.","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB8","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB9","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/0209042","article-title":"Generating all maximal independent sets: NP-hardness and polynomial-time algorithms","volume":"9","author":"Lawler","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1109\/TC.1979.1675435","article-title":"On minimum cost recovery from system deadlock","volume":"28","author":"Leung","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/0607036","article-title":"Hard enumeration problems in geometry and combinatorics","volume":"7","author":"Linial","year":"1986","journal-title":"SIAM J. on Algebraic and Discrete Methods"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB12","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","article-title":"A minmax relation for directed graphs","volume":"17","author":"Lucchesi","year":"1978","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB13","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","article-title":"The maximum clique problem","author":"Pardalos","year":"1994","journal-title":"J. Global Opt."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB14","unstructured":"E.M. Reingold, J. Nievergelt, N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, USA, 1977 (Chapter 8)."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB15","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1137\/S0097539794270881","article-title":"An optimal algorithm for scanning all spanning trees of undirected graphs","volume":"26","author":"Shioura","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB16","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","author":"Smith","year":"1975","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB17","doi-asserted-by":"crossref","unstructured":"E. Speckenmeyer, On feedback problems in digraphs, in: M. Nagl (Ed.), Proceedings of the 15th International Workshop on Graph\u2013Theoretic Concepts in Computer Science, Castle Rolduc, The Netherlands, Springer, Berlin, Lecture Notes in Computer Science, Vol. 411, 1989, pp. 218\u2013231.","DOI":"10.1007\/3-540-52292-1_16"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB18","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1006\/jagm.1997.0891","article-title":"Generating the acyclic orientations of a graph","volume":"26","author":"Squire","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00339-5_BIB19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/00207728008967010","article-title":"Enumeration of all minimum feedback edge sets in a directed graph","volume":"11","author":"Srimani","year":"1980","journal-title":"Int. J. Systems Sci."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB20","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00339-5_BIB21","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. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T23:50:54Z","timestamp":1557100254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X00003395"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00339-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}