On the Minimum of True Matches in Exact Graph Matching with Simulated Annealing

Document Type : Research Paper


1 Department of Computer Science, Amir Kabir University of Technology, Tehran, Iran

2 Faculty of Mathematics and Computer science, Hakim Sabzevari University, Sabzevar, Iran

3 Department of Computer Science, Damghan University


Graph matching is one of the most important problems in graph theory and combinatorial optimization, with many applications in various domains. Although meta-heuristic algorithms have had good performance on many NP-Hard and NP-Complete problems, but for graph matching problem, there were not reported superior solutions by these sort of algorithms. The reason of this inefficiency  has not been investigated yet. In this paper it has been shown that Simulated Annealing (SA) as an instance of a meta-heuristic method is unlikely to be even close to the optimal solution for this problem. Mathematical and experimental results showed that the chance to reach to a partial solution, is very low, even for small number of true matches. In addition to theoretical discussion, the experimental results also verified our idea; for example, in two sample graphs with $10000$ vertices, the probability of reaching to a solution with at least three correct matches is about $0.02$ with simulated annealing.