2026-07-22T06:31:11Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6967 2024-03-06T10:28:04Z ddc:004 open_access

Algebra and the Complexity of Digraph CSPs: a Survey Larose, Benoit Constraint satisfaction problems Polymorphisms Digraphs 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Benoit Larose 2017 Is Part Of Dagstuhl Follow-Ups, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability (2017) InCollection Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DFU.Vol7.15301.267 urn:nbn:de:0030-drops-69677 https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.267 eng https://creativecommons.org/licenses/by/3.0/legalcode