Advertisement

Towards a Trichotomy for Quantified H-Coloring

  • Barnaby Martin
  • Florent Madelaine
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)

Abstract

Hell and Nešetřil proved that the H-colouring problem is NP-complete if, and only if, H is bipartite. In this paper, we investigate the complexity of the quantified H-colouring problem (a restriction of the quantified constraint satisfaction problem to undirected graphs). We introduce this problem using a new two player colouring game. We prove that the quantified H-colouring problem is:

1. tractable, if H is bipartite;

2. NP-complete, if H is not bipartite and not connected; and,

3. Pspace-complete, if H is connected and has a unique cycle, which is of odd length.

We conjecture that the last case extends to all non-bipartite connected graphs.

Keywords

Bipartite Graph Constraint Satisfaction Problem Winning Strategy Universal Variable Unique Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hell, P., Nešetřil, J.: On the complexity of H-coloring. J. Combin. Theory Ser. B 48(1), 92–110 (1990)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Schaefer, T.J.: The complexity of satisfiability problems. In: 10th Annual ACM Symp. on Theory of Computing (1978)Google Scholar
  3. 3.
    Jeavons, P.: On the algebraic structure of combinatorial problems. Theoret. Comput. Sci. 200(1–2), 185–204 (1998)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3) (2005)Google Scholar
  5. 5.
    Bulatov, A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS 2002 (to appear, 2002)Google Scholar
  6. 6.
    Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput. 28(1), 57–104 (1999)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Creignou, N., Khanna, S., Sudan, M.: Complexity classifications of Boolean constraint satisfaction problems. In: SIAM Monographs on Discrete Mathematics and Applications (2001)Google Scholar
  8. 8.
    Dalmau, V.: A dichotomy theorem for learning quantified boolean formulas. Machine Learning 35(3) (1999)Google Scholar
  9. 9.
    Börner, F., Bulatov, A., Jeavons, P., Krokhin, A.: Quantified constraints: algorithms and complexity. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 58–70. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Chen, H.: Collapsibility and consistency in quantified constraint satisfaction. In: Procs. 19th National Conference on AI (2004)Google Scholar
  11. 11.
    Bjäreland, M., Jonsson, P.: Exploiting bipartiteness to identify yet another tractable subclass of CSP. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 118–128. Springer, Heidelberg (1999)Google Scholar
  12. 12.
    Gradel, E.: Model checking games. Electronic Notes in Theoretical Computer Science 67 (2002)Google Scholar
  13. 13.
    Hell, P., Nešetřil, J.: Graphs and homomorphisms. Oxford Lecture Series in Maths and its Applications, vol. 28. OUP (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Barnaby Martin
    • 1
  • Florent Madelaine
    • 1
  1. 1.Department of Computer ScienceUniversity of DurhamU.K.

Personalised recommendations