A study on k-walk generation algorithm to prevent the tottering in graph edit distance heuristic algorithms

Graph edit distance is usually used for graph similarity checking due to its low information loss and flexibility advantages. However, graph edit distance can’t be used efficiently because it is an NP-Hard problem. Many graph edit distance heuristic algorithms have been proposed to solve this proble...

Ausführliche Beschreibung