University of TehranJournal of Algorithms and Computation2476-277653120210601On the Minimum of True Matches in Exact Graph Matching with Simulated Annealing1231348162810.22059/jac.2021.81628ENHashemEzzatiDepartment of Computer Science, Amir Kabir University of Technology, Tehran, IranMahmoodAmintoosiFaculty of Mathematics and Computer science, Hakim Sabzevari University, Sabzevar, IranHashemTabasiDepartment of Computer Science, Damghan UniversityJournal Article20210531Graph 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.https://jac.ut.ac.ir/article_81628_c4ff6be4c01880d61752828a09af50ca.pdf