Using Graph Decomposition for Solving Continuous CSPs.
Christian BliekBertrand NeveuGilles TrombettoniPublished in: CP (1998)
Keyphrases
- tree decomposition
- constraint satisfaction problems
- constraint problems
- graph theory
- constraint networks
- decomposition method
- partial constraint satisfaction
- decomposition methods
- backtracking algorithm
- hypertree decomposition
- probabilistic reasoning
- series parallel
- graph model
- solving constraint satisfaction problems
- graph databases
- structural learning
- graph representation
- branch and bound
- random walk
- structured data
- constraint graph
- combinatorial optimization
- graph cuts
- configuration problems
- constraint satisfaction
- graph matching
- bayesian networks
- directed graph
- sat encodings
- graph coloring
- soft constraints
- distributed constraint satisfaction problems
- bipartite graph
- arc consistency
- weighted graph