Using Graph Decomposition for Solving Continuous CSPs


In practice, constraint satisfaction problems are often struc-tured. By exploiting this structure, solving algorithms can make important gains in performance. In this paper, we focus on structured continuous CSPs deened by systems of equations. We use graph decomposition techniques to decompose the constraint graph into a directed acyclic graph of small… (More)
DOI: 10.1007/3-540-49481-2_9


Cite this paper

@inproceedings{Bliek1998UsingGD, title={Using Graph Decomposition for Solving Continuous CSPs}, author={Christian Bliek and Bertrand Neveu and Gilles Trombettoni}, booktitle={CP}, year={1998} }