Constraint Satisfaction Problems for Reducts of Homogeneous Graphs.
Manuel BodirskyBarnaby MartinMichael PinskerAndrás PongráczPublished in: SIAM J. Comput. (2019)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint graph
- graph based representations
- constraint propagation
- constraint programming
- np complete
- non binary
- search space
- arc consistency
- combinatorial problems
- constraint networks
- computational problems
- graph theory
- constraint optimization
- forward checking
- partial constraint satisfaction
- constraint solving
- global constraints
- soft constraints
- graph matching
- np hard
- decomposition methods
- finite domain
- constraint problems
- bounded treewidth
- reasoning problems
- graph partitioning
- symmetry breaking
- binary constraints
- tractable classes
- backtracking search
- finding optimal solutions
- scheduling problem
- graph coloring