A new error-correcting distance for attributed relational graph problems

Abstract

In this paper a new distance for attributed relational graphs is proposed. The main idea of the new algorithm is to decompose the graphs to be matched into smaller subgraphs. The matching process is then done at the level of the decomposed subgraphs based on the concept of error-correcting transformations. The distance between two graphs is found to be the minimum of a weighted bipartite graph constructed from the decomposed subgraphs. The average computational complexity of the proposed distance is found to be 4 O(N), which is much better than many techniques. © Springer-Verlag Berlin Heidelberg 2000.