At their core, graph matching seeks to identify an optimal correspondence between the nodes of two graphs, while edit distance algorithms measure the minimum number of operations—such as ...