Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linked: How Everything Is Connected to Everything Else and What It Means
Linked: How Everything Is Connected to Everything Else and What It Means
Measuring the similarity of labeled graphs
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
Filtering for subgraph isomorphism
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Efficiently Solving Problems Where the Solutions Form a Group
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Polynomial Algorithm for Submap Isomorphism
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
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
Polynomial algorithms for open plane graph and subgraph isomorphisms
Theoretical Computer Science
On the subgraph epimorphism problem
Discrete Applied Mathematics
Hi-index | 0.00 |
We introduce a new filtering algorithm, called IDL(d)-filtering, for a global constraint dedicated to the graph isomorphism problem--the goal of which is to decide if two given graphs have an identical structure. The basic idea of IDL(d)-filtering is to label every vertex with respect to its relationships with other vertices around it in the graph, and to use these labels to filter domains by removing values that have different labels. IDL(d)-filtering is parameterized by a positive integer value d which gives a limit on the distance between a vertex to be labelled and the set of vertices considered to build its label. We experimentally compare different instantiations of IDL(d)-filtering with state-of-the-art dedicated algorithms and show that IDL(d)-filtering is more efficient on regular sparse graphs and competitive on other kinds of graphs.