English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30162
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


A conductance electrical model for representing and matching weighted undirected graphs

AuthorsIgelmo, Manuel; Sanfeliu, Alberto ; Ferrer, Miquel
KeywordsGraph isomorphism
Conductance electrical model
Weigthed undirected graphs
Pattern recognition
Pattern recognition systems
Issue Date2010
Citation20th International Conference on Pattern Recognition: 958-961 (2010)
AbstractIn 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.
DescriptionTrabajo presentado al ICPR 2010 celebrado en Estambul (Turquía) del 23 al 26 de agosto.
Publisher version (URL)http://dx.doi.org/10.1109/ICPR.2010.240
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
conductance electrical.pdf399,76 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.