Constraint Satisfaction Problems for Reducts of Homogeneous Graphs.
Manuel BodirskyBarnaby MartinMichael PinskerAndrás PongráczPublished in: ICALP (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint graph
- constraint propagation
- constraint programming
- graph based representations
- search space
- np complete
- constraint networks
- arc consistency
- np hard
- decomposition methods
- non binary
- combinatorial problems
- constraint solving
- solving constraint satisfaction problems
- computational problems
- soft constraints
- graph theory
- graph matching
- undirected graph
- constraint problems
- finite domain
- graph coloring
- symmetry breaking
- forward checking
- backtracking search
- finding optimal solutions
- disjunctive temporal
- tractable classes
- constraint optimization
- backtracking algorithm
- path consistency
- sat problem
- global constraints
- scheduling problem