AllDifferent-based Filtering for Subgraph Isomorphism - Archive ouverte HAL Access content directly
Journal Articles Artificial Intelligence Year : 2010

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.
Fichier principal
Vignette du fichier
Liris-4670.pdf (459 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01381476 , version 1 (06-03-2017)



Christine Solnon. AllDifferent-based Filtering for Subgraph Isomorphism. Artificial Intelligence, 2010, 12-13, 174, pp.850-864. ⟨10.1016/j.artint.2010.05.002⟩. ⟨hal-01381476⟩
111 View
123 Download



Gmail Facebook Twitter LinkedIn More