{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:18:06Z","timestamp":1648955886382},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":[[1998,11]]},"DOI":"10.1016\/s0020-0190(98)00154-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"141-146","source":"Crossref","is-referenced-by-count":0,"title":["A polynomial time solvable instance of the feasible minimum cover problem"],"prefix":"10.1016","volume":"68","author":[{"given":"Chor-Ping","family":"Low","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00154-9_BIB1","first-page":"842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957"},{"key":"10.1016\/S0020-0190(98)00154-9_BIB2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(91)90062-T","article-title":"The uniquely solvable bipartite matching problem","volume":"10","author":"Cechlarova","year":"1991","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0020-0190(98)00154-9_BIB3","doi-asserted-by":"crossref","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","article-title":"Coverings of bipartite graphs","volume":"10","author":"Dulmage","year":"1958","journal-title":"Canad. J. Math"},{"key":"10.1016\/S0020-0190(98)00154-9_BIB4","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(98)00154-9_BIB5","series-title":"Proc. IEEE Internat. Workshop on Defect and Fault Tolerance on VLSI Systems","first-page":"260","article-title":"Fast search algorithms for reconfiguration problems","author":"Hadas","year":"1991"},{"key":"10.1016\/S0020-0190(98)00154-9_BIB6","series-title":"Proc. Internat. Symp. on Fault-Tolerant Computing","first-page":"348","article-title":"Minimum fault coverage in reconfigurable arrays","author":"Hasan","year":"1988"},{"key":"10.1016\/S0020-0190(98)00154-9_BIB7","series-title":"Proc. 26th ACM\/IEEE Design Automation Conf.","first-page":"710","article-title":"On the repair of redundant RAMs","author":"Hemmady","year":"1989"},{"issue":"4","key":"10.1016\/S0020-0190(98)00154-9_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n2.5 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00154-9_BIB9","first-page":"116","article-title":"Graphs and matrices","volume":"38","author":"K\u00f6nig","year":"1931","journal-title":"Mat. Fiz. Lapok"},{"issue":"1","key":"10.1016\/S0020-0190(98)00154-9_BIB10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MDT.1987.295111","article-title":"Efficient spare allocation for reconfigurable arrays","volume":"4","author":"Kuo","year":"1987","journal-title":"IEEE Design Test"},{"key":"10.1016\/S0020-0190(98)00154-9_BIB11","series-title":"Introduction to Combinatorial Mathematics","author":"Liu","year":"1968"},{"key":"10.1016\/S0020-0190(98)00154-9_BIB12","article-title":"Matching Theory","volume":"29","author":"Lov\u00e1sz","year":"1986"},{"issue":"5","key":"10.1016\/S0020-0190(98)00154-9_BIB13","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1109\/12.509914","article-title":"A new class of efficient algorithms for reconfiguration of memory arrays","volume":"45","author":"Low","year":"1996","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/S0020-0190(98)00154-9_BIB14","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/43.503937","article-title":"Minimum fault coverage in memory arrays: A fast algorithm and probabilistic analysis","volume":"15","author":"Low","year":"1996","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/S0020-0190(98)00154-9_BIB15","article-title":"Design, analysis, and reconfiguration of defecttolerant VLSI and parallel processors arrays","author":"Shi","year":"1992"},{"issue":"9","key":"10.1016\/S0020-0190(98)00154-9_BIB16","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1109\/43.160001","article-title":"Probabilistic analysis and algorithms for reconfiguration of memory arrays","volume":"11","author":"Shi","year":"1992","journal-title":"IEEE Trans. Computer-Aided Design"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001549?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001549?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:28:42Z","timestamp":1556058522000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0020019098001549"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00154-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}