| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428109 | Information Processing Letters | 2009 | 6 Pages |
Abstract
In this note, we show that every constraint satisfaction problem that has relational width 2 has also relational width 1. This is achieved by means of an obstruction-like characterization of relational width which we believe to be of independent interest.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
