{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:05Z","timestamp":1720640825612},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0653(04)00449-4","type":"journal-article","created":{"date-parts":[[2004,10,23]],"date-time":"2004-10-23T09:17:34Z","timestamp":1098523054000},"page":"108-111","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Enumeration of Circuits and Minimal Forbidden Sets"],"prefix":"10.1016","volume":"13","author":[{"given":"Frederik","family":"Stork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB1","unstructured":"M. Bartusch, Optimierung von Netzpl\u00e4nen mit anordnungsbeziehungen bei knappen Betriebsmitteln, Ph. D. thesis, Rheinisch-Westf\u00e4lische Technische Hochschule Aachen, Aachen, Germany (1984)."},{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB2","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1137\/S0097539701388768","article-title":"Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities","volume":"31","author":"Boros","year":"2002","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB4","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":"Information Processing Letters"},{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB5","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 Journal on Computing"},{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB6","series-title":"Matroid Theory","author":"Oxley","year":"1992"},{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB7","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB8","unstructured":"F. Stork, Stochastic resource-constrained project scheduling, Ph. D. thesis, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Berlin, Germany (2001)."},{"key":"10.1016\/S1571-0653(04)00449-4_NEWBIB9","doi-asserted-by":"crossref","unstructured":"F. Stork, M. Uetz, On the enumeration of minimal covers and minimal forbidden sets, METEOR Research Memborandum 02\/036, Universiteit Maastricht, Maastricht, The Netherlands (2002).","DOI":"10.26481\/umamet.2002036"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004494?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004494?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T17:08:52Z","timestamp":1624727332000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":9,"alternative-id":["S1571065304004494"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00449-4","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}