Login / Signup
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems.
Achref El Mouelhi
Philippe Jégou
Cyril Terrioux
Bruno Zanuttini
Published in:
ISAIM (2012)
Keyphrases
</>
backtracking algorithms
search algorithm
constraint propagation
computational complexity
constraint satisfaction
dynamic programming
upper bound
constraint networks
non binary