{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:15:36Z","timestamp":1649060136942},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00504-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"191-196","source":"Crossref","is-referenced-by-count":16,"title":["Minimum feedback vertex sets in shuffle-based interconnection networks"],"prefix":"10.1016","volume":"86","author":[{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"first","affiliation":[]},{"given":"Peter","family":"Ru\u017ei\u010dka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00504-5_BIB001","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0895480196305124","article-title":"A 2-approximation algorithm for the undirected feedback vertex set problem","volume":"12","author":"Bafna","year":"1999","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(02)00504-5_BIB002","first-page":"129","article-title":"Decycling cubes and grids","volume":"59","author":"Bau","year":"2001","journal-title":"Utilitas Math."},{"key":"10.1016\/S0020-0190(02)00504-5_BIB003","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H","article-title":"Decycling graphs","volume":"25","author":"Beineke","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(02)00504-5_BIB004","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1137\/S0097539796305109","article-title":"Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference","volume":"27","author":"Bar-Yehuda","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00504-5_BIB005","series-title":"Proceedings in Informatics 11, SIROCCO 2001","first-page":"77","article-title":"New bounds on the size of the minimum feedback vertex set in meshes and butterflies","author":"Caragiannis","year":"2001"},{"key":"10.1016\/S0020-0190(02)00504-5_BIB006","series-title":"Handbook of Combinatorial Optimization, Vol. A","first-page":"209","article-title":"Feedback set problems","author":"Festa","year":"1999"},{"key":"10.1016\/S0020-0190(02)00504-5_BIB007","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(00)00127-7","article-title":"Feedback vertex set in hypercubes","volume":"76","author":"Focardi","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00504-5_BIB008","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(02)00504-5_BIB009","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(94)00133-2","article-title":"On the feedback vertex set in permutation graphs","volume":"52","author":"Liang","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00504-5_BIB010","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s002360050088","article-title":"Minimum feedback vertex set in cocomparability graphs and convex bipartite graphs","volume":"34","author":"Liang","year":"1997","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(02)00504-5_BIB011","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0020-0190(96)00193-7","article-title":"A linear-time algorithm for the weighted feedback vertex problem on interval graphs","volume":"61","author":"Lu","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00504-5_BIB012","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0020-0190(98)00039-8","article-title":"Almost exact minimum feedback vertex set in meshes and butterflies","volume":"66","author":"Luccio","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00504-5_BIB013","unstructured":"D.A. Pike, Decycling hypercubes, Submitted for publication, 2002"},{"key":"10.1016\/S0020-0190(02)00504-5_BIB014","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":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:26:18Z","timestamp":1553405178000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002005045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002005045"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00504-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}