Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A graph distance metric combining maximum common subgraph and minimum common supergraph

Autor
Fernández, M.; Valiente, G.
Tipus d'activitat
Document cientificotècnic
Data
2001-01
Codi
R01-2
Repositori
http://hdl.handle.net/2117/97631 Obrir en finestra nova
Resum
The relationship between two important problems in pattern recognition using attributed relational graphs, the maximum common subgraph and the minimum common supergraph of two graphs, is established by means of simple constructions, which allow to obtain the maximum common subgraph from the minimum common supergraph, and vice versa. On this basis, a new graph distance metric is proposed for measuring similarities between objects represented by attributed relational graphs. The proposed metric ca...
Citació
Fernández, M., Valiente, G. "A Graph distance metric combining maximum common subgraph and minimum common supergraph". 2001.
Paraules clau
Attributed relational graph, Error-correcting graph matching, Graph edit distance, Maximum common subgraph, Minimum common supergraph, Optimal graph matching, Subgraph isomorphism
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius