Neural network approach for solving the maximal common subgraph problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 26, Issue 5, 1996, Pages 785-790

  Shoukry, Amin ^a   Aboutabl, Mohamed ^a  

^a Alexandria University The Faculty Of Engineering   (Egypt)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

MAXIMAL COMMON SUBGRAPH PROBLEM; SEQUENTIAL SEARCH BASED SOLUTIONS; TWO STAGE HOPFIELD NEURAL NETWORK;

NEURAL NETWORKS;

EID: 0030270310     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.537320     Document Type: Article

References (19)

1. L. Shapiro and R. M. Haralick, "A metric for comparing relational descriptions," IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, no. 1, pp. 90-94, Jan. 1985.
2. A. Sanfelieu and K. S. Fu, "A distance measure between attributed relational graphs for pattern recognition," IEEE Trans. Syst., Man, Cybern., vol. SMC-13, May/June 1983.
3. E. Rich, Artificial Intelligence. New York: McGraw-Hill, 1st ed., 1983.
4. W. J. Masek, "A faster algorithm computing string edit distances," Comp. and Syst. Sciences, vol. 20, pp. 19-31, 1980.
5. G. Levi, "A note on the derivation of the maximal common subgraph of two directed or undirected graphs," Calcola, vol. 9, pp. 1-12, 1972.
6. J. R. Ullman, "An algorithm for subgraph homomorphisms," J. Ass. Compta. Mach., vol. 23, pp. 31-42, Jan. 1976.
7. J. J. McGregor, "Backtrack search algorithms and the maximal common subgraph problem," Software-Practice and Experience, vol. 12, pp. 23-34, 1982.
8. E. Mjolsness and C. Garrett, "Algebraic transformation of objective functions," Neural Networks, vol. 3, pp. 651-669, 1990.
9. C. H. Leung, "Structural matching using neural networks," First INNS Meeting Abstracts, 1988, p. 31.
10. N. M. Nasrabadi and W. Li, "Object recognition by a Hopfield neural network," IEEE Trans. Syst., Man, Cybern., vol. 21, no. 6, Nov./Dec. 1991.
11. J. J. Hopfield, "Neurons with graded response have collective computational properties like those of two-state neurons," in Proc. Nat. Academy of Science of the USA, 1984, vol. 81, pp. 3088-3092.
12. D. W. Tank and J. J. Hopfield, "Simple neural optimization networks: An A/D converter, signal decision circuit and a linear programming circuit," IEEE Trans. Circuits Syst., vol. CAS-33, no. 3, May 1986.
13. Hinton et al., "Bolzmann machines, constraint satisfaction networks that learn," Carnegie-Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-Cs-84-119, 1984.
14. D. E. Van Den Bout and T. K. Miller, "Graph partitioning using annealed networks," IEEE Trans. Neural Networks, vol. 1, no. 2, pp. 192-204, 1990.
15. J. Hertz, A. Krogh, and R. Palmer, Introduction to the Theory of Neural Computation. Reading, MA: Addison-Wesley, 1991.
16. S. Kirkpatrick et al., "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, 1983.
17. B. E. Gillett, Introduction to Operations Research, A Computer-Oriented Algorithmic Approach. New York: McGraw-Hill, 1976.
18. S. V. B. Aiyer et al., "A theoritical investigation into the performance of the Hopfield model," IEEE Trans. Neural Networks, vol. 1, no. 2, pp. 204-215, 1990.
19. M. Minsky and S. Papert, "On some associative, parallel and analog computations," Associative Information Techniques, Edwin L. Jacks, Ed. New York: American Elsevier, 1971.