AllDifferent-based filtering for subgraph isomorphism

11 years 9 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with filtering techniques that aim at pruning branches that do not contain solutions. We introduce a new filtering algorithm based on local all different constraints. We show that this filtering is stronger than other existing filterings -i.e., it prunes more branches-- and that it is also more efficient --i.e., it allows one to solve more instances quicker. Key words: Subgraph Isomorphism, Constraint Programming, All Different constraint
Christine Solnon
Added 08 Dec 2010
Updated 08 Dec 2010
Type Journal
Year 2010
Where AI
Authors Christine Solnon
Comments (0)