A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Replicator Equations, Maximal Cliques, and Graph Isomorphism
Neural Computation
Probabilistic subgraph matching based on convex relaxation
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Genetic-based search for error-correcting graph isomorphism
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A new spectral bound on the clique number of graphs
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
| Hi-index | 0.00 |
In this paper we propose a new lower bound to a subgraph isomorphism problem. This bound can provide a proof that no subgraph isomorphism between two graphs can be found. The computation is based on the SDP relaxation of a - to the best of our knowledge - new combinatorial optimisation formulation for subgraph isomorphism. We consider problem instances where only the structures of the two graph instances are given and therefore we deal with simple graphs in the first place. The idea is based on the fact that a subgraph isomorphism for such problem instances always leads to 0 as lowest possible optimal objective value for our combinatorial optimisation problem formulation. Therefore, a lower bound that is larger than 0 represents a proof that a subgraph isomorphism don't exist in the problem instance. But note that conversely, a negative lower bound does not imply that a subgraph isomorphism must be present and only indicates that a subgraph isomorphism is still possible.