License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2010.2467
URN: urn:nbn:de:0030-drops-24675
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2467/
Go to the corresponding Portal


Egri, László ; Krokhin, Andrei ; Larose, Benoit ; Tesson, Pascal

The Complexity of the List Homomorphism Problem for Graphs

pdf-format:
Document 1.pdf (306 KB)


Abstract

We completely classify the computational complexity of the list $\bH$-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph $\bH$ 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.

BibTeX - Entry

@InProceedings{egri_et_al:LIPIcs:2010:2467,
  author =	{L{\'a}szl{\'o} Egri and Andrei Krokhin and Benoit Larose and Pascal Tesson},
  title =	{{The Complexity of the List Homomorphism Problem for Graphs}},
  booktitle =	{27th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{335--346},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-16-3},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{5},
  editor =	{Jean-Yves Marion and Thomas Schwentick},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2467},
  URN =		{urn:nbn:de:0030-drops-24675},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2467},
  annote =	{Keywords: Graph homomorphism, constraint satisfaction problem, complexity, universal algebra, Datalog}
}

Keywords: Graph homomorphism, constraint satisfaction problem, complexity, universal algebra, Datalog
Seminar: 27th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2010
Date of publication: 09.03.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI