A Neural Supergraph Matching Architecture

Abstract

A neural supergraph matching architecture is introduced based on relaxation labeling and the minimum common supergraph of pairs of graphs. The system is implemented on correlation matrix memories and is efficient in constructing this supergraph. We test the effectiveness of this graphical cluster representation on two different sets of graphs. 

Topics

6 Figures and Tables

Cite this paper

@inproceedings{Klinger2005ANS, title={A Neural Supergraph Matching Architecture}, author={Stefan Klinger and Jim Austin}, year={2005} }