{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:01Z","timestamp":1725583981845},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_24","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T20:43:48Z","timestamp":1369082628000},"page":"231-240","source":"Crossref","is-referenced-by-count":0,"title":["The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs"],"prefix":"10.1007","author":[{"given":"Carlos A.","family":"Martinhon","sequence":"first","affiliation":[]},{"given":"Lu\u00e9rbio","family":"Faria","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory. Algorithms and Applications. Prentice-Hall (1993)"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.tcs.2008.09.021","volume":"409","author":"A. Abouelaoualim","year":"2008","unstructured":"Abouelaoualim, A., Das, K.C., Faria, L., Manoussakis, Y., Martinhon, C.A., Saad, R.: Paths and trails in edge-colored graphs. Theoretical Computer Science\u00a0409(3), 497\u2013510 (2008)","journal-title":"Theoretical Computer Science"},{"key":"24_CR3","first-page":"1433","volume":"49","author":"P. Berman","year":"2003","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Hardness of Short Symmetric Instances of MAX-3SAT. Elect. Colloquium on Comput. Complexity\u00a0(49), 1433\u20138092 (2003)","journal-title":"Elect. Colloquium on Comput. Complexity"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, crowds and markets: Reasoning about a highly connected world, Cambridge (2010)","DOI":"10.1017\/CBO9780511761942"},{"key":"24_CR5","unstructured":"Gamvros, I.: Satellite network design, optimization and management, PhD thesis, University of Maryland (2006)"},{"key":"24_CR6","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.: Computers and intractability: a guide to the theory of np-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"24_CR7","volume-title":"Handbooks in Operations Research and Management Science","author":"A.M.H. Gerards","year":"1995","unstructured":"Gerards, A.M.H.: Matching, Network Models. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operations Research and Management Science, vol.\u00a07. North-Holland, Amsterdam (1995)"},{"issue":"2","key":"24_CR8","first-page":"57","volume":"14","author":"L. Gourv\u00e8s","year":"2012","unstructured":"Gourv\u00e8s, L., Lyra, A., Martinhon, C., Monnot, J.: On paths, trails and closed trails in edge-colored graphs. Discrete Mathematics and Theoretical Computer Science\u00a014(2), 57\u201374 (2012)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Lyra, A., Martinhon, C., Monnot, J.: Complexity of trails, paths and circuits in arc-colored digraphs. To Appear in the Disc. Appl. Math (2012)","DOI":"10.1016\/j.dam.2012.10.025"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. of Oper. Res.\u00a017(1), 36\u201342 (1992)","journal-title":"Math. of Oper. Res."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01188582","volume":"13","author":"P.A. Pevzner","year":"1995","unstructured":"Pevzner, P.A.: DNA physical mapping and properly edge-colored eurelian cycles in colored graphs. Algorithmica\u00a013, 77\u2013105 (1995)","journal-title":"Algorithmica"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Pevzner, P.A.: Computational molecular biology: an algorithmic approach. MIT Press (2000)","DOI":"10.7551\/mitpress\/2022.001.0001"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.amc.2009.04.086","volume":"215","author":"H. Xu","year":"2009","unstructured":"Xu, H., Li, K., Kilgour, M., Hipel, K.: A matrix-based approach to searching colored paths in a weighted colored multidigraph. Appl. Math. and Comp.\u00a0215, 353\u2013366 (2009)","journal-title":"Appl. Math. and Comp."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0095-8956(82)90047-8","volume":"33","author":"B. Sands","year":"1982","unstructured":"Sands, B., Sauer, N., Woodrow, R.E.: On monochromatic paths in edge-coloured digraphs. J. Comb. Theory (B)\u00a033, 271\u2013275 (1982)","journal-title":"J. Comb. Theory (B)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jctb.1997.1728","volume":"69","author":"A. Yeo","year":"1997","unstructured":"Yeo, A.: A note on alternating cycles in edge-coloured Graphs. Journal of Comb. Theory, Series B\u00a069, 222\u2013225 (1997)","journal-title":"Journal of Comb. Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:16:07Z","timestamp":1557702967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}