Arc and path consistence revisited
Artificial Intelligence
A new algorithm for graph monomorphism based on the projections of the product graph
IEEE Transactions on Systems, Man and Cybernetics
Tree search and ARC consistency in constraint satisfaction algorithms
Search in Artificial Intelligence
Random number generators: good ones are hard to find
Communications of the ACM
Model matching in robot vision by subgraph isomorphism
Pattern Recognition
SubGemini: identifying subcircuits using a fast subgraph isomorphism algorithm
DAC '93 Proceedings of the 30th international Design Automation Conference
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
An algebraic framework for the transformation of attributed graphs
Term graph rewriting
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Arc-consistency and arc-consistency again
Artificial Intelligence
Structural and syntactic pattern recognition
Handbook of pattern recognition & computer vision
A theoretical evaluation of selected backtracking algorithms
Artificial Intelligence
Using constraint metaknowledge to reduce arc consistency computation
Artificial Intelligence
A Backtrack Procedure for Isomorphism of Directed Graphs
Journal of the ACM (JACM)
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
The CWEB System of Structured Documentation: Version 3.0
The CWEB System of Structured Documentation: Version 3.0
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Pattern Matching in PROGRES
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
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
On Forward Checking for Non-binary Constraint Satisfaction
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Interpreting Sloppy Stick Figures by Graph Rectification and Constraint-Based Matching
GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Generalized Graph Matching for Data Mining and Information Retrieval
ICDM '08 Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects
Adaptable Support for Queries and Transformations for the DRAGOS Graph-Database
Applications of Graph Transformations with Industrial Relevance
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Recent Advances in Constraints
Efficient Suboptimal Graph Isomorphism
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Graph Transformation with Incremental Updates
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph Transformation in Relational Databases
Electronic Notes in Theoretical Computer Science (ENTCS)
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
Electronic Notes in Theoretical Computer Science (ENTCS)
On graphs with unique node labels
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
An algorithm portfolio for the sub-graph isomorphism problem
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Filtering for subgraph isomorphism
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence
Interactive searching and visualization of patterns in attributed graphs
Proceedings of Graphics Interface 2010
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Efficient many-to-many feature matching under the l1 norm
Computer Vision and Image Understanding
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
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
ClouDiA: a deployment advisor for public clouds
Proceedings of the VLDB Endowment
On the subgraph epimorphism problem
Discrete Applied Mathematics
Hi-index | 0.00 |
Graph pattern matching is a central problem in many application fields. Since it is NP-complete, we cannot expect to find algorithms with a good worst-case performance. However, there is still room for general procedures with a good average performance. In this paper we explore four different solving approaches within the constraint satisfaction framework, and introduce a new algorithm, which we call nRF+. The algorithm is a refinement of really full look ahead that takes advantage of the problem structure in order to enhance the look ahead procedure. We give a formal proof that nRF+ is superior to the other approaches in terms of number of visited nodes. An additional contribution of this paper is the introduction of a new benchmark for testing algorithms in this domain. It is formed by a large set of well-defined graphs of very diverse nature. In this benchmark, we show that nRF+ can efficiently solve a broad range of problems, while still leaving many problem instances unsolved. The use of this challenging benchmark is encouraged for future algorithms evaluation.