Abstract

Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose an efficient and effective graph manipulation technique that can be used in graph-based similarity search. Given a query graph G q (V; E), we would like to determine fast which are the graphs in the database that are similar to G q (V; E), with respect to a similarity measure. First, we study the similarity measure between two graphs. Then, we discuss graph representation techniques by means of multidimensional vectors. It is shown that no false dismissals are introduced by using the vector representation. Finally we illustrate some representative queries that can be handled by our approach, and present experimental results, based on the proposed graph similarity algorithm. The results show that considerable savings are obtained with respect to computational effort and I/O operations, in comparison to conventional searching techniques.

Citations