DFU.Vol7.15301.267.pdf
- Filesize: 0.49 MB
- 19 pages
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.
Feedback for Dagstuhl Publishing