{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:09Z","timestamp":1771036329535,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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,11]]},"DOI":"10.1016\/s0020-0190(02)00265-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T20:29:59Z","timestamp":1034281799000},"page":"131-139","source":"Crossref","is-referenced-by-count":22,"title":["Minimum feedback vertex set and acyclic coloring"],"prefix":"10.1016","volume":"84","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Godard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00265-X_BIB001","series-title":"Proc. ISAAC'95, Algorithms and Computation","first-page":"142","article-title":"Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs","volume":"1004","author":"Bafna","year":"1995"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB002","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)00265-X_BIB003","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","article-title":"On acyclic colorings of planar graphs","volume":"25","author":"Borodin","year":"1979","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"10.1016\/S0020-0190(02)00265-X_BIB004","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0166-218X(00)00359-0","article-title":"Acyclic colouring of 1-planar graphs","volume":"114","author":"Borodin","year":"2001","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/S0020-0190(02)00265-X_BIB005","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1112\/S0024610799007942","article-title":"Acyclic colourings of planar graphs with large girth","volume":"60","author":"Borodin","year":"1999","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0020-0190(02)00265-X_BIB006","series-title":"Graph Classes: A Survey","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB007","series-title":"18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'92)","first-page":"1","article-title":"On improved time bounds for permutation graphs problem","volume":"657","author":"Brandst\u00e4dt","year":"1992"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB008","first-page":"21","article-title":"Every 4-valent graph has an acyclic 5 coloring","volume":"93","author":"Burstein","year":"1979","journal-title":"Soob\u0161\u010d. Akad. Nauk Gruzin. SSR"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB009","first-page":"77","article-title":"New bounds on the size of the minimum feedback vertex set in meshes and butterflies","volume":"11","author":"Caragiannis","year":"2001"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB010","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/net.3230260205","article-title":"Feedback vertex set on cocomparability graphs","volume":"26","author":"Coorg","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB011","first-page":"209","article-title":"Feedback set problems","volume":"A","author":"Festa","year":"1999"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB012","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."},{"issue":"3","key":"10.1016\/S0020-0190(02)00265-X_BIB013","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF02764716","article-title":"Acyclic colorings of planar graphs","volume":"14","author":"Gr\u00fcnbaum","year":"1973","journal-title":"Israel J. Math."},{"issue":"1","key":"10.1016\/S0020-0190(02)00265-X_BIB014","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1006\/jagm.2000.1137","article-title":"Wavelength conversion in optical networks","volume":"38","author":"Kleinberg","year":"2001","journal-title":"J. of Algorithms"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB015","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)00265-X_BIB016","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 ans butterflies","volume":"66","author":"Luccio","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00265-X_BIB017","series-title":"3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO'96), Proceedings in Informatics","first-page":"152","article-title":"Local majority voting, small coalitions and controlling monopolies in graphs: A review","author":"Peleg","year":"1996"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB018","first-page":"191","article-title":"The chromatic number of oriented graphs","volume":"25","author":"Sopena","year":"1997","journal-title":"Math. Notes"},{"key":"10.1016\/S0020-0190(02)00265-X_BIB019","series-title":"2\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications (AlgoTel 2000)","first-page":"35","article-title":"Placement de convertisseurs de longueurs d'ondes dans les r\u00e9seaux optiques","author":"Togni","year":"2000"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900200265X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900200265X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T21:54:45Z","timestamp":1555106085000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900200265X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S002001900200265X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00265-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}