An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
Relational Matching
A Linear Programming Approach for the Weighted Graph Matching Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
A large database of graphs and its use for benchmarking graph isomorphism algorithms
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
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
Constraint-Based Local Search
Linked: How Everything Is Connected to Everything Else and What It Means
Linked: How Everything Is Connected to Everything Else and What It Means
Graph edit distance with node splitting and merging, and its application to diatom identification
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
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
Ant algorithm for the graph matching problem
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Reactive tabu search for measuring graph similarity
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence
A semantic framework for intelligent matchmaking for clinical trial eligibility criteria
ACM Transactions on Intelligent Systems and Technology (TIST) - Survey papers, special sections on the semantic adaptive social web, intelligent systems for health informatics, regular papers
On the subgraph epimorphism problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. It covers measures based on univalent matchings, such that each node is matched with at most one node, as well as multivalent matchings, such that a node may be matched with a set of nodes. This language is designed on top of Comet, a programming language supporting both Constraint Programming (CP) and Constraint-Based Local Search (CBLS). Starting from the constraint-based description of the measure, we automatically generate a Comet program for computing the measure. Depending on the measure characteristics, this program either uses CP --which is better suited for computing exact measures such as (sub)graph isomorphism-- or CBLS --which is better suited for computing error-tolerant measures such as graph edit distances. First experimental results show the feasibility of our approach.