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
Introduction to Algorithms
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Performance Evaluation of the VF Graph Matching Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
Graph Matching: A Fast Algorithm and Its Evaluation
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Linked: How Everything Is Connected to Everything Else and What It Means
Linked: How Everything Is Connected to Everything Else and What It Means
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
Efficient graph automorphism by vertex partitioning
Artificial Intelligence
Network motif discovery using subgraph enumeration and symmetry-breaking
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Filtering for subgraph isomorphism
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence
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
CP models for maximum common subgraph problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
An empirical study of seeding manipulations and their prevention
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
Real-Time exact graph matching with application in human action recognition
HBU'12 Proceedings of the Third international conference on Human Behavior Understanding
ClouDiA: a deployment advisor for public clouds
Proceedings of the VLDB Endowment
On the subgraph epimorphism problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated filtering algorithm to solve this problem within the context of constraint programming. The main idea of the filtering algorithm is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph isomorphism. This partial order over labels is used to filter domains. Labelings can also be strengthened by adding information from the labels of neighbors. Such a strengthening can be applied iteratively until a fixpoint is reached. Practical experiments illustrate that our new filtering approach is more effective on difficult instances of scale free graphs than state-of-the-art algorithms and other constraint programming approaches.