- Authors:
- Roberto J Bayardo,
- Daniel P. Miranker
We present and analyze a polynomially space-bounded backtrack algorithm for solving constraint satisfaction problems. We show the algorithm is capable of bounding worst-case runtime almost as effectively as the best exponential space-consuming schemes, and more effectively than various other schemes including the cycle-cutset method [Dechter, 90], pseudo-tree search [Freuder & Quinn, 85], and echniques exploiting nonseparable component decomposition of the constraint graph [Freuder, 85; Dechter, 87]. Experiments on randomly generated problems show the algorithm is capable of solving classes of problems on which a forward checking algorithm with dynamic search rearrangement [Haralick & Elliot, 80] often fails.
Recommendations
Restricted space algorithms for isomorphism on bounded treewidth graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time. We give restricted space algorithms for these problems proving the following results:*Isomorphism for ...
A sufficient condition for backtrack-bounded search
Backtrack search is often used to solve constraint satisfaction problems. A relationship involving the structure of the constraints is described that provides a bound on the backtracking required to advance deeper into the backtrack tree. This analysis ...