On the speed of constraint propagation and the time complexity of arc consistency testing
J. Comput. Syst. Sci., Volume 91, 2018, Pages 104-114.
Establishing arc consistency on two relational structures is one of the most popular heuristics for the constraint satisfaction problem. We aim at determining the time complexity of arc consistency testing. The input structures G and H can be supposed to be connected colored graphs, as the general problem reduces to this particular case. ...More
PPT (Upload PPT)