Neural network approach for solving the maximal common subgraph problem

Authors:
A. Shoukry;M. Aboutabl
Affiliations:
Dept. of Comput. Sci., Alexandria Univ.;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
1996

Citing 0
Cited 3

A Taxonomy of Hybrid Metaheuristics

Journal of Heuristics
A New Error-Correcting Distance for Attributed Relational Graph Problems

Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
An approach to a feature-based comparison of solid models of machined parts

Artificial Intelligence for Engineering Design, Analysis and Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new formulation of the maximal common subgraph problem (MCSP), that is implemented using a two-stage Hopfield neural network, is given. Relative merits of this proposed formulation, with respect to current neural network-based solutions as well as classical sequential-search-based solutions, are discussed