A conductance electrical model for representing and matching weighted undirected graphs

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/10494

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Enginyeria de Sistemes, Automàtica i Informàtica Industrial
dc.contributor	Institut de Robòtica i Informàtica Industrial
dc.contributor	Universitat Politècnica de Catalunya. VIS - Visió Artificial i Sistemes Intel.ligents
dc.contributor.author	Igelmo Ganzo, Manuel
dc.contributor.author	Sanfeliu Cortés, Alberto
dc.contributor.author	Ferrer Sumsi, Miquel
dc.date	2010
dc.identifier.citation	Igelmo, M.; Sanfeliu, A.; Ferrer, M. A conductance electrical model for representing and matching weighted undirected graphs. A: International Conference on Pattern Recognition. "20th International Conference on Pattern Recognition". 2010, p. 958-961.
dc.identifier.citation	10.1109/ICPR.2010.240
dc.identifier.uri	http://hdl.handle.net/2117/10494
dc.language.iso	eng
dc.relation	http://dx.doi.org/10.1109/ICPR.2010.240
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica::Modelització matemàtica
dc.subject	Mathematical models
dc.subject	pattern recognition PARAULES AUTOR: graph isomorphism
dc.subject	conductance electrical model
dc.subject	weigthed undirected graphs
dc.subject	Modelització matemàtica
dc.subject	Classificació INSPEC::Modelling
dc.title	A conductance electrical model for representing and matching weighted undirected graphs
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graphs. The model is built by transforming a graph into an electrical circuit. Edges in the graph become conductances in the electrical circuit. This model follows the laws of the electrical circuit theory and we can potentially use all the existing theory and tools of this field to derive other approximate techniques for graph matching. In the present work, we use the proposed circuital model to derive approximated graph isomorphism solutions.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author