{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:35Z","timestamp":1725516635383},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_35","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"374-383","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs"],"prefix":"10.1007","author":[{"given":"A.","family":"Gupta","sequence":"first","affiliation":[]},{"given":"M.","family":"Karimi","sequence":"additional","affiliation":[]},{"given":"E. J.","family":"Kim","sequence":"additional","affiliation":[]},{"given":"A.","family":"Rafiey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/jgt.3190200214","volume":"20","author":"J. Bang-Jensen","year":"1995","unstructured":"Bang-Jensen, J.: Digraphs with the path-merging property. J. Graph Theory\u00a020, 255\u2013265 (1995)","journal-title":"J. Graph Theory"},{"key":"35_CR2","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2000","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jctb.1993.1069","volume":"59","author":"J. Bang-Jensen","year":"1993","unstructured":"Bang-Jensen, J., Huang, J., Prisner, E.: In-tournament digraphs. J. Combin. Theory Ser. B\u00a059, 267\u2013287 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/(SICI)1097-0118(199808)28:4<171::AID-JGT1>3.0.CO;2-G","volume":"28","author":"J. Bang-Jensen","year":"1998","unstructured":"Bang-Jensen, J., Gutin, G.: Generalizations of tournaments: A survey. J. Graph Theory\u00a028, 171\u2013202 (1998)","journal-title":"J. Graph Theory"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hell, P., Karimi, M., Rafiey, A.: Minimum Cost Homomorphisms to Reflexive Digraphs. In: Proceedings of the 8th Latin American Theoretical Informatics (LATIN 2008) (to appear, 2008)","DOI":"10.1007\/978-3-540-78773-0_16"},{"key":"35_CR6","unstructured":"Gupta, A., Gutin, G., Karimi, M., Kim, E.J., Rafiey, A.: Minimum Cost Homomorphisms to Locally semicomplete Digraphs and Quasi-transitive Digraphs (submitted)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Karimi, M., Kim, E.J., Rafiey, A.: Minimum Cost Homomorphisms Dichotomy for Locally In- Semicomplete Digraphs. Journal of Discrete Applied Mathematics (submitted)","DOI":"10.1007\/978-3-540-85097-7_35"},{"key":"35_CR8","unstructured":"Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphism to Oriented Cycles (submitted)"},{"key":"35_CR9","unstructured":"Gutin, G., Kim, E.J.: Complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (submitted)"},{"key":"35_CR10","unstructured":"Gutin, G., Kim, E.J.: Introduction to the minimum cost homomorphism problem for directed and undirected graphs. Lecture Notes of the Ramanujan Math. Society (to appear)"},{"key":"35_CR11","unstructured":"Gutin, G., Kim, E.J.: On the complexity of the minimum cost homomorphism problem for reflexive multipartite tournaments (submitted)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.dam.2005.11.006","volume":"154","author":"G. Gutin","year":"2006","unstructured":"Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost and List Homomorphisms to Semicomplete Digraphs. Discrete Appl. Math.\u00a0154, 890\u2013897 (2006)","journal-title":"Discrete Appl. Math."},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. Discrete Applied Math. (submitted)","DOI":"10.1016\/j.dam.2007.09.023"},{"key":"35_CR14","unstructured":"Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs (submitted)"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.06.012","volume":"154","author":"G. Gutin","year":"2006","unstructured":"Gutin, G., Rafiey, A., Yeo, A., Tso, M.: Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Appl. Math.\u00a0154, 881\u2013889 (2006)","journal-title":"Discrete Appl. Math."},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Gutin, G., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. European J. Combin. (to appear)","DOI":"10.1016\/j.ejc.2007.11.012"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-colouring. J. Combin. Theory B\u00a048, 92\u2013110 (1990)","journal-title":"J. Combin. Theory B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:06Z","timestamp":1619523666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}