Graph matching: a fast algorithm and its evaluation

Author

Cordella, L.P. ; Foggia, P. ; Sansone, C. ; Tortorella, F. ; Vento, M.

Author_Institution

Dipt. di Inf. e Sistemistica, Naples Univ. Federico II, Italy

Volume

2

fYear

1998

fDate

16-20 Aug 1998

Firstpage

1582

Abstract

A graph matching algorithm is illustrated and its performance compared with that of a well known algorithm performing the same task. According to the proposed algorithm the matching process is carried out by using a state space representation: a state represents a partial solution of the matching between two graphs, and a transition between states corresponds to the addition of a new pair of matched nodes. A set of feasibility rules is introduced for pruning states corresponding to partial matching solutions not satisfying the required graph morphism. Results outlining the computational cost reduction achieved by the method are given with reference to a set of randomly generated graphs

Keywords

graph theory; pattern matching; state-space methods; computational cost reduction; feasibility rules; graph matching algorithm; graph morphism; partial matching solutions; randomly generated graphs; state space representation; Computational efficiency; Data structures; Deformable models; Electronic mail; Pattern matching; Pattern recognition; Prototypes; Read only memory; State-space methods; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on

Conference_Location

Brisbane, Qld.

ISSN

1051-4651

Print_ISBN

0-8186-8512-3

Type

conf

DOI

10.1109/ICPR.1998.712014

Filename

712014