The complexity of the list homomorphism problem for graphs

Details The complexity of the list homomorphism problem for graphs The complexity of the list homomorphism problem for graphs

2009-12-18

arxiv.org/abs/0912.3802v3

Computer Science

Computational Complexity

12 pages, STACS 2010

Scientific paper

We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is first-order definable; descriptive complexity equivalents are given as well via Datalog and its fragments. Our algebraic characterisations match important conjectures in the study of constraint satisfaction problems.

Affiliated with

Also associated with

No associations

Rating

The complexity of the list homomorphism problem for graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complexity of the list homomorphism problem for graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of the list homomorphism problem for graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381502