Constraint satisfaction problems for reducts of homogeneous graphs.
Manuel BodirskyBarnaby MartinMichael PinskerAndrás PongráczPublished in: CoRR (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint graph
- constraint programming
- np complete
- graph based representations
- constraint propagation
- search space
- arc consistency
- non binary
- constraint solving
- graph matching
- computational problems
- constraint networks
- combinatorial problems
- partial constraint satisfaction
- np hard
- global constraints
- forward checking
- finite domain
- pseudo boolean optimization
- sat problem
- temporal constraints
- decomposition methods
- graph coloring
- constraint problems
- random graphs
- variable ordering
- soft constraints
- backtracking algorithm
- backtracking search
- solving constraint satisfaction problems
- graph model
- search algorithm