Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing complexity of the graphs increased the algorithm's running time ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Therefore, this paper proposes a bipartite graph matching optimization algorithm based on simulated annealing. This algorithm integrates prior knowledge from the computer vision field and improves ...