A generalization of the Hopfield model for the graph isomorphism problem

 

Abstract

Isomorphism identification between graphs is an important NP-complete problem with many science and engineering applications. Although excellent progresses have been made towards special graphs, no known polynomial-time algorithm for graph isomorphism has been found for general graphs. In this paper a generalization of the Hopfield neural network for isomorphism identification between general graphs is proposed. Simulation results show that this model is much superior to recently presented neural networks for this problem. The effectiveness of the resultant network does not seem to be decreased as the size of the graph is increased. This allows us to solve graph isomorphism problems with a big number of vertices, while many recently presented approaches only present results for graphs with up to 15 vertices.

Citation

Please, cite this work as:

[GLM08] G. Galán-Marín, D. López-Rodríguez, and E. Mérida-Casermeiro. “A generalization of the Hopfield model for the graph isomorphism problem”. In: Computing and Computational Techniques in Sciences, 2008. WSEAS. 2008, pp. 98-100.

BibTeX

@inproceedings{Iso2008,
     title={A generalization of the Hopfield model for the graph isomorphism problem},
     author={Galán-Marín, Gloria and López-Rodríguez, Domingo and Mérida-Casermeiro, Enrique},
     booktitle={Computing and Computational Techniques in Sciences, 2008},
     pages={98–100},
     year={2008},
     organization={WSEAS}
}