Solving subgraph isomorphism problems with constraint programming.
Stéphane ZampelliYves DevilleChristine SolnonPublished in: Constraints An Int. J. (2010)
Keyphrases
- constraint programming
- search heuristics
- combinatorial problems
- finite domain
- constraint problems
- constraint propagation
- constraint satisfaction problems
- constraint solvers
- constraint satisfaction
- combinatorial search
- subgraph isomorphism
- hard problems
- np complete
- search strategies
- symmetry breaking
- data mining
- greedy algorithm
- traveling salesman problem
- combinatorial optimization
- shortest path
- object recognition