Abstract
For digraphs G and H, a homomorphism of G to H is a mapping such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). In the minimum cost homomorphism problem we associate costs c i (u), u ∈ V(G), i ∈ V(H) with the mapping of u to i and the cost of a homomorphism f is defined ∑ u ∈ V(G) c f(u)(u) accordingly. Here the minimum cost homomorphism problem for a fixed digraph H, denoted by MinHOM(H), is to check whether there exists a homomorphism of G to H and to obtain one of minimum cost, if one does exit.
The minimum cost homomorphism problem is now well understood for digraphs with loops. For loopless digraphs only partial results are known. In this paper, we find a full dichotomy classification of MinHom(H), when H is a locally in-semicomplete digraph. This is one of the largest classes of loopless digraphs for which such dichotomy classification has been proved. This paper extends the previous result for locally semicomplete digraphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bang-Jensen, J.: Digraphs with the path-merging property. J. Graph Theory 20, 255–265 (1995)
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)
Bang-Jensen, J., Huang, J., Prisner, E.: In-tournament digraphs. J. Combin. Theory Ser. B 59, 267–287 (1993)
Bang-Jensen, J., Gutin, G.: Generalizations of tournaments: A survey. J. Graph Theory 28, 171–202 (1998)
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)
Gupta, A., Gutin, G., Karimi, M., Kim, E.J., Rafiey, A.: Minimum Cost Homomorphisms to Locally semicomplete Digraphs and Quasi-transitive Digraphs (submitted)
Gupta, A., Karimi, M., Kim, E.J., Rafiey, A.: Minimum Cost Homomorphisms Dichotomy for Locally In- Semicomplete Digraphs. Journal of Discrete Applied Mathematics (submitted)
Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphism to Oriented Cycles (submitted)
Gutin, G., Kim, E.J.: Complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (submitted)
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)
Gutin, G., Kim, E.J.: On the complexity of the minimum cost homomorphism problem for reflexive multipartite tournaments (submitted)
Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost and List Homomorphisms to Semicomplete Digraphs. Discrete Appl. Math. 154, 890–897 (2006)
Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. Discrete Applied Math. (submitted)
Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs (submitted)
Gutin, G., Rafiey, A., Yeo, A., Tso, M.: Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Appl. Math. 154, 881–889 (2006)
Gutin, G., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. European J. Combin. (to appear)
Hell, P., Nešetřil, J.: On the complexity of H-colouring. J. Combin. Theory B 48, 92–110 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, A., Karimi, M., Kim, E.J., Rafiey, A. (2008). Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)