Arc and path consistence revisited
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Performance Evaluation of the VF Graph Matching Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
Constraint-Based Local Search
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Theoretical analysis of singleton arc consistency and its extensions
Artificial Intelligence
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Constraint Networks: Techniques and Algorithms
Constraint Networks: Techniques and Algorithms
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Computer Vision and Image Understanding
An efficient light solver for querying the semantic web
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP models for maximum common subgraph problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Castor: a constraint-based SPARQL engine with active filter processing
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
On the subgraph epimorphism problem
Discrete Applied Mathematics
| Hi-index | 0.01 |
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.