{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:28Z","timestamp":1759063828368},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":[[2002,9]]},"DOI":"10.1016\/s0020-0190(02)00266-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"275-280","source":"Crossref","is-referenced-by-count":27,"title":["New bounds on the size of the minimum feedback vertex set in meshes and butterflies"],"prefix":"10.1016","volume":"83","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Kanellopoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(02)00266-1_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."},{"issue":"4","key":"10.1016\/S0020-0190(02)00266-1_BIB002","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)00266-1_BIB003","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)00266-1_BIB004","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(02)00266-1_BIB005","series-title":"Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 99)","first-page":"566","article-title":"Wavelength conversion in optical networks","author":"Kleinberg","year":"1999"},{"key":"10.1016\/S0020-0190(02)00266-1_BIB006","series-title":"Introduction to Parallel Algorithms and Architectures","author":"Leighton","year":"1992"},{"key":"10.1016\/S0020-0190(02)00266-1_BIB007","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s002360050088","article-title":"Minimum feedback vertex set in comparability graphs and convex bipartite graphs","volume":"34","author":"Liang","year":"1997","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/S0020-0190(02)00266-1_BIB008","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)00266-1_BIB009","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)00266-1_BIB010","series-title":"Proc. 3rd Colloquium on Structural Information and Communication Complexity (SIROCCO 96)","first-page":"152","article-title":"Local majority voting, small coalitions and controlling monopolies in graphs: A review","author":"Peleg","year":"1996"},{"issue":"4","key":"10.1016\/S0020-0190(02)00266-1_BIB011","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0208051","article-title":"A linear time algorithm for finding minimum cutsets in reducible graphs","volume":"8","author":"Shamir","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00266-1_BIB012","series-title":"Proc. ALGOTEL 2000","article-title":"Placement de convertisseurs de longueurs d'ondes dans les r\u00e9seaux optiques","author":"Togni","year":"2000"},{"issue":"2","key":"10.1016\/S0020-0190(02)00266-1_BIB013","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:S0020019002002661?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002661?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:23:46Z","timestamp":1555118626000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0020019002002661"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00266-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}