{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T06:40:47Z","timestamp":1694846447219},"reference-count":9,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T00:00:00Z","timestamp":1531180800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["301254\/2015\u20100305889\/2015\u20100870038\/2002\u20108"],"award-info":[{"award-number":["301254\/2015\u20100305889\/2015\u20100870038\/2002\u20108"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given an edge\u2010colored graph <jats:italic>G<\/jats:italic>, a cycle with all its edges with different colors is called a rainbow cycle. The rainbow cycle cover (RCC) problem consists of finding the minimum number of disjoint rainbow cycles covering <jats:italic>G<\/jats:italic>. We present an integer linear programming model for the RCC problem and a reduction process for decreasing the dimensions of the graph, resulting in a more efficient method that was able to find new optimal solutions for instances that were unsolved.<\/jats:p>","DOI":"10.1002\/net.21833","type":"journal-article","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T10:05:00Z","timestamp":1531217100000},"page":"38-47","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A note on the rainbow cycle cover problem"],"prefix":"10.1002","volume":"73","author":[{"given":"Jorge","family":"Moreno","sequence":"first","affiliation":[{"name":"Universidade Federal Fluminense Instituto de Computa\u00e7\u00e3o Rio de Janeiro Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Martins","sequence":"additional","affiliation":[{"name":"Universidade Federal Fluminense Instituto de Computa\u00e7\u00e3o Rio de Janeiro Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Frota","sequence":"additional","affiliation":[{"name":"Universidade Federal Fluminense Instituto de Computa\u00e7\u00e3o Rio de Janeiro Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,7,10]]},"reference":[{"key":"e_1_2_7_2_1","first-page":"R105","article-title":"On lengths of rainbow cycles","volume":"13","author":"Alexeev B.","year":"2006","journal-title":"J Comb"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9044-x"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-008-0789-5"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00034-9"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2291790"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.033"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.01.016"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21700"},{"key":"e_1_2_7_10_1","first-page":"227","article-title":"On the complexity of edge\u2010colored subgraph partitioning problems in network optimization","volume":"17","author":"Zhang X.","year":"2016","journal-title":"Discrete Math Theor Comput Sci"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21833","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.21833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T21:19:02Z","timestamp":1694812742000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.21833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1002\/net.21833"],"URL":"https:\/\/doi.org\/10.1002\/net.21833","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,10]]},"assertion":[{"value":"2017-09-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-16","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}