License
When quoting this document, please refer to the following
DOI: 10.4230/DFU.Vol7.15301.267
URN: urn:nbn:de:0030-drops-69677
URL: http://drops.dagstuhl.de/opus/volltexte/2017/6967/
Go to the corresponding DFU Volume Portal


Larose, Benoit

Algebra and the Complexity of Digraph CSPs: a Survey

pdf-format:
DFU-Vol7-15301-10.pdf (0.5 MB)


Abstract

We present a brief survey of some of the key results on the interplay between algebraic and graph-theoretic methods in the study of the complexity of digraph-based constraint satisfaction problems.

BibTeX - Entry

@InCollection{larose:DFU:2017:6967,
  author =	{Benoit Larose},
  title =	{{Algebra and the Complexity of Digraph CSPs: a Survey}},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  pages =	{267--285},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-95977-003-3},
  ISSN =	{1868-8977},
  year =	{2017},
  volume =	{7},
  editor =	{Andrei Krokhin and Stanislav Zivny},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6967},
  URN =		{urn:nbn:de:0030-drops-69677},
  doi =		{10.4230/DFU.Vol7.15301.267},
  annote =	{Keywords: Constraint satisfaction problems, Polymorphisms, Digraphs}
}

Keywords: Constraint satisfaction problems, Polymorphisms, Digraphs
Seminar: The Constraint Satisfaction Problem: Complexity and Approximability
Issue Date: 2017
Date of publication: 14.02.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI