Skip to main content
SpringerLink
Log in

Minimum Cost Homomorphisms to Reflexive Digraphs

  • Conference paper
LATIN 2008: Theoretical Informatics (LATIN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4957))

Included in the following conference series:

Abstract

For a fixed digraph H, the minimum cost homomorphism problem, MinHOM(H), asks whether an input digraph G, with given costs c i (u), u ∈ V(G), i ∈ V(H), and an integer k, admits a homomorphism to H of total cost not exceeding k.

Minimum cost homomorphism problems encompass many well studied optimization problems such as list homomorphism problems, retraction and precolouring extension problems, chromatic partition optimization, and applied problems in repair analysis.

For undirected graphs the complexity of the problem, as a function of the parameter H, is well understood; for digraphs, the situation appears to be more complex, and only partial results are known. We focus on the minimum cost homomorphism problem for reflexive digraphs H. It is known that MinHOM(H) is polynomial if H has a Min-Max ordering. We prove that for any other reflexive digraph H, the problem MinHOM(H) is NP-complete. (This was earlier conjectured by Gutin and Kim.) Apart from undirected graphs, this is the first general class of digraphs for which such a dichotomy has been proved. Our proof involves a forbidden induced subgraph characterization of reflexive digraphs with a Min-Max ordering, and implies a polynomial test for the existence of a Min-Max ordering in a reflexive digraph H.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alekseev, V.E., Lozin, V.V.: Independent sets of maximum weight in (p,q)-colorable graphs. Discrete Mathematics 265, 351–356 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)

    Google Scholar 

  3. Brewster, R.C., Hell, P.: Homomorphisms to powers of digraphs. Discrete Mathematics 244, 31–41 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: A maximal tractable class of soft constraints. J. Artif. Intell. Res. 22, 1–22 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Feder, T.: Homomorphisms to oriented cycles and k-partite satisfiability. SIAM J. Discrete Math 14, 471–480 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Feder, T., Hell, P., Huang, J.: Bi-arc graphs and the complexity of list homomorphisms, J. Graph Theory 42, 61–80 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Feder, T., Hell, P., Tucker-Nally, K.: Digraph matrix partitions and trigraph homomorphisms. Discrete Applied Mathematics 154, 2458–2469 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Feder, T., Hell, P., Huang, J.: List homomorphisms to reflexive digraphs (manuscript, 2005)

    Google Scholar 

  9. Feder, T.: Classification of Homomorphisms to Oriented Cycles and k-Partite Satisfiability. SIAM Journal on Discrete Mathematics 14, 471–480 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gutin, G., Kim, E.J.: Complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (submitted)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. Gutin, G., Kim, E.J.: On the complexity of the minimum cost homomorphism problem for reflexive multipartite tournaments (submitted)

    Google Scholar 

  13. Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost and List Homomorphisms to Semicomplete Digraphs. Discrete Appl. Math. 154, 890–897 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. Discrete Applied Math. (submitted)

    Google Scholar 

  15. Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs (submitted)

    Google Scholar 

  16. 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)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gutin, G., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. European J. Combin. (to appear)

    Google Scholar 

  18. Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Minimizing average completion of dedicated tasks and interval graphs. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 114–126. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Hell, P.: Algorithmic aspects of graph homomorphisms. In: Survey in Combinatorics 2003, London Math. Soc. Lecture Note Series, vol. 307, pp. 239–276. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  20. Hell, P., Nešetřil, J.: On the complexity of H-colouring. J. Combin. Theory B 48, 92–110 (1990)

    Article  MATH  Google Scholar 

  21. Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)

    MATH  Google Scholar 

  22. Hell, P., Huang, J.: Interval bigraphs and circular arc graphs. J. Graph Theory 46, 313–327 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  23. Hell, P., Nešetřil, J., Zhu, X.: Complexity of Tree Homomorphisms. Discrete Applied Mathematics 70, 23–36 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  24. Jansen, K.: Approximation results for the optimum cost chromatic partition problem. J. Algorithms 34, 54–89 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  25. Jiang, T., West, D.B.: Coloring of trees with minimum sum of colors. J. Graph Theory 32, 354–358 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  26. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.: The approximability of constraint satisfaction problems. SIAM Journal on Computing 30, 1863–1920 (2000)

    Article  MathSciNet  Google Scholar 

  27. Kroon, L.G., Sen, A., Deng, H., Roy, A.: The optimal cost chromatic partition problem for trees and interval graphs. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 279–292. Springer, Heidelberg (1997)

    Google Scholar 

  28. Lovász, L.: Three short proofs in graph theory. J. Combin. Theory, Ser. B 19, 269–271 (1975)

    Article  MATH  Google Scholar 

  29. Supowit, K.: Finding a maximum planar subset of a set of nets in a channel. IEEE Trans. Computer-Aided Design 6, 93–94 (1987)

    Article  Google Scholar 

  30. Wegner, G.: Eigenschaften der nerven homologische-einfactor familien in Rn, Ph.D. Thesis, Universität Gottigen, Gottigen, Germany (1967)

    Google Scholar 

  31. West, D.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (1996)

    MATH  Google Scholar 

  32. Zhou, H.: Characterization of the homomorphic preimages of certain oriented cycles. SIAM Journal on Discrete Mathematics 6, 87–99 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada, V5A 1S6

    Arvind Gupta, Pavol Hell, Mehdi Karimi & Arash Rafiey

Authors
  1. Arvind Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavol Hell
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mehdi Karimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Arash Rafiey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eduardo Sany Laber Claudson Bornstein Loana Tito Nogueira Luerbio Faria

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gupta, A., Hell, P., Karimi, M., Rafiey, A. (2008). Minimum Cost Homomorphisms to Reflexive Digraphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds) LATIN 2008: Theoretical Informatics. LATIN 2008. Lecture Notes in Computer Science, vol 4957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78773-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78773-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78772-3

  • Online ISBN: 978-3-540-78773-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation