Approach for solving the graph-matching problem based on ant colony algorithm
The main goal of Kieu Diem’s PhD is to propose an approach for solving the graph-matching problem based on ant colony algorithm.
In graph matching category, the graph edit distance (GED) is her main concern, since it is more general and highly used.
Besides, the ant colony algorithm may be used to solve the GED in an indirect way by transforming the GED into a quadratic assignment problem (QAP).
Furthermore, some modifications of the ant algorithm are made in order to adapt and boost the performance of the proposed algorithm.