The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Algorithms for approximate graph matching
Information Sciences—Informatics and Computer Science: An International Journal
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
An algorithm using length-r paths to approximate subgraph isomorphism
Pattern Recognition Letters
NP-SPEC: An Executable Specification Language for Solving All Problems in NP
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Compiling High-Level Type Constructors in Constraint Programming
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
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
The Subgraph Bisimulation Problem
IEEE Transactions on Knowledge and Data Engineering
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constraints
Cardinal: A Finite Sets Constraint Solver
Constraints
The "Not-Too-Heavy Spanning Tree" Constraint
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The range and roots constraints: specifying counting and occurrence problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The rules of constraint modelling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Filtering for subgraph isomorphism
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The minimum spanning tree constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Filtering algorithms for the NVALUE constraint
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too accurate. We focus here on approximations declared by the user within the pattern (optional nodes and forbidden arcs), covering graph/subgraph mono/isomorphism problems. In this paper, we show how the integration of two domains of computation over countable structures, graphs and maps , can be used for modeling and solving various graph matching problems from the simple graph isomorphism to approximate graph matching. To achieve this, we extend map variables allowing the domain and range to be non-fixed and constrained. We describe how such extended maps are designed then realized on top of finite domain and finite set variables with specific propagators. We show how a single monomorphism constraint is sufficient to model and solve those multiples graph matching problems. Furthermore, our experimental results show that our CP approach is competitive with a state of the art algorithm for subgraph isomorphism.