Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms.
Philippe VismaraBenoît ValéryPublished in: MCO (2008)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- connected subgraphs
- constraint optimization
- robust fault detection
- constraint programming
- forward checking
- learning algorithm
- constraint propagation
- constraint problems
- soft constraints
- russian doll search
- constraint relaxation
- maximum clique
- relaxation labeling
- constraint networks
- heuristic search
- special case
- objective function