DFU.Vol7.15301.267.pdf
- Filesize: 0.49 MB
- 19 pages
Document
Algebra and the Complexity of Digraph CSPs: a Survey
Author
-
Part of:
Volume:
The Constraint Satisfaction Problem: Complexity and Approximability (DFU - Vol. 7)
Series: Dagstuhl Follow-Ups (DFU) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-02-21
Cite AsGet BibTex
Benoit Larose. Algebra and the Complexity of Digraph CSPs: a Survey. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 267-285, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/DFU.Vol7.15301.267
https://doi.org/10.4230/DFU.Vol7.15301.267
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.
Keywords
- Constraint satisfaction problems
- Polymorphisms
- Digraphs
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads