• Media type: Text; E-Article
  • Title: Algebra and the Complexity of Digraph CSPs: a Survey
  • Contributor: Larose, Benoit [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
  • Language: English
  • DOI: https://doi.org/10.4230/DFU.Vol7.15301.267
  • Keywords: Constraint satisfaction problems ; Polymorphisms ; Digraphs
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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.
  • Access State: Open Access