Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/97631
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor.author | Fernández, Mirtha-Lina |
dc.contributor.author | Valiente Feruglio, Gabriel Alejandro |
dc.date | 2001-01 |
dc.identifier.citation | Fernández, M., Valiente, G. "A Graph distance metric combining maximum common subgraph and minimum common supergraph". 2001. |
dc.identifier.uri | http://hdl.handle.net/2117/97631 |
dc.language.iso | eng |
dc.relation | LSI-01-2-R |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject | Optimal graph matching |
dc.subject | Error-correcting graph matching |
dc.subject | Attributed relational graph |
dc.subject | Graph edit distance |
dc.subject | Subgraph isomorphism |
dc.subject | Maximum common subgraph |
dc.subject | Minimum common supergraph |
dc.title | A Graph distance metric combining maximum common subgraph and minimum common supergraph |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/report |
dc.description.abstract |