{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:24Z","timestamp":1725893964269},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_36","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:55:47Z","timestamp":1188302147000},"page":"343-353","source":"Crossref","is-referenced-by-count":2,"title":["An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem"],"prefix":"10.1007","author":[{"given":"Jianxin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoshuang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunlong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","first-page":"348","volume-title":"Pro of the 18th International Symposium on Fault-Tolerant Computing (FTCS 1988)","author":"N. Hasan","year":"1988","unstructured":"Hasan, N., Liu, C.L.: Minimum Fault Coverage in Reconfigurable Arrays. In: Pro of the 18th International Symposium on Fault-Tolerant Computing (FTCS 1988), pp. 348\u2013353. IEEE Computer Society Press, Los Alamitos,CA (1988)"},{"key":"36_CR2","volume-title":"Principles of Artificial Intelligence","author":"N.J. Niosson","year":"1980","unstructured":"Niosson, N.J.: Principles of Artificial Intelligence. Tioga Publishing Co., Palo Alto, CA (1980)"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MDT.1987.295111","volume":"4","author":"S.Y. Kuo","year":"1987","unstructured":"Kuo, S.Y., Fuchs, W.: Efficient spare allocation for reconfigurable arrays. IEEE Des. Test\u00a04, 24\u201331 (1987)","journal-title":"IEEE Des. Test"},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/12.127443","volume":"41","author":"D.M. Blough","year":"1992","unstructured":"Blough, D.M., Pelc, A.: Complexity of fault diagnosis in comparison models. IEEE Trans.Comput.\u00a041(3), 318\u2013323 (1992)","journal-title":"IEEE Trans.Comput."},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1109\/12.509914","volume":"45","author":"C.P. Low","year":"1996","unstructured":"Low, C.P., Leong, H.W.: A new class of efficient algorithms for reconfiguration of memery arrays. IEEE Trans. Comput.\u00a045(1), 614\u2013618 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/12.481492","volume":"45","author":"M.D. Smith","year":"1996","unstructured":"Smith, M.D., Mazumder, P.: Generation of minimal vertex cover for row\/column allocation in self-repairable arrays. IEEE Trans.Comput.\u00a045, 109\u2013115 (1996)","journal-title":"IEEE Trans.Comput."},{"key":"36_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1006\/jagm.2000.1141","volume":"38","author":"H. Fernau","year":"2001","unstructured":"Fernau, H., Niedermeier, R.: An efficient exact algorithm for constraint bipartite vertex cover. J.Algorithms\u00a038, 374\u2013410 (2001)","journal-title":"J.Algorithms"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.jcss.2003.09.003","volume":"67","author":"J. Chen","year":"2003","unstructured":"Chen, J., Kanj, I.A.: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. Journal of Computer and System Science\u00a067, 833\u2013847 (2003)","journal-title":"Journal of Computer and System Science"},{"key":"36_CR10","volume-title":"Annals of Discrete Mathematics","author":"L. Lovasz","year":"1986","unstructured":"Lovasz, L., Plummer, M.D.: Matching Theory. In: Annals of Discrete Mathematics, vol.\u00a029, North-Holland, Amsterdam (1986)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms, 280\u2013301 (2001)","DOI":"10.1006\/jagm.2001.1186"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:51:45Z","timestamp":1619502705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}