Solving inexact graph isomorphism problems using neural networks

Neurocomputing

Volumn 63, Issue SPEC. ISS., 2005, Pages 45-67

  Jain, Brijnesh J ^a   Wysotzki, Fritz ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Association graph; Graph isomorphism; Hopfield network; Maximum clique

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; MOLECULAR STRUCTURE; PROBLEM SOLVING;

ENERGY-MINIMIZING MATCHING PROCESS; ISOMORPHISM PROBLEMS; NEURAL REFINEMENT PROCEDURE; WEIGHTED GRAPHS;

NEURAL NETWORKS;

ANALYTIC METHOD; ANALYTICAL ERROR; ARTICLE; ARTIFICIAL NEURAL NETWORK; CHEMICAL STRUCTURE; EXPERIMENTATION; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROBLEM SOLVING;

EID: 12144281717     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2004.01.189     Document Type: Article

References (42)

1. M. Abdulrahim M. Misra A graph isomorphism algorithm for object recognition Pattern Anal. Appl. 1 3 1998 189-201
2. T. Ae, K. Agusa, S. Fujita, M. Yamashita, On neural networks for graph isomorphism problem, in: The RNNS/IEEE Symposium on Neuroinformatics and Neurocomputers, 1992, pp. 1142-1148.
3. H.A. Almohamad A polynomial transform for matching pairs of weighted graphs J. Appl. Math. Model. 15 4 1991
4. H.A. Almohamad S.O. Duffuaa A linear programming approach for the weighted graph matching problem IEEE Trans. Pattern Anal. Mach. Intell. 15 5 1993 522-525
5. A.P. Ambler, H.G. Barrow, C.M. Brown, R.M. Burstall, R. J. Popplestone, A versatile computer-controlled assembly system, in: International Joint Conference on Artificial Intelligence, Stanford University, California, 1973, pp. 298-307.
6. L. Babai P. Erdös S. Selkow Random graph isomorphism SIAM J. Comput. 9 1980 628-635
7. D.H. Ballard C.M. Brown Computer Vision 1982 Prentice-Hall Englewood Cliffs, N.J.
8. H. Barrow R. Burstall Subgraph isomorphism, matching relational structures and maximal cliques Inform. Process. Lett. 4 1976 83-84
9. S. Bischoff, D. Reuss, F. Wysotzki, Applied connectionist methods in computer vision to compare segmented images, in: A. Günter, R. Kruse, B. Neumann (Eds.), KI 2003: Advances in Artificial Intelligence, 26th Annual Conference on AI, Lecture Notes On Artificial Intelligence 2821, Springer, Berlin, 2003, pp. 312-326.
10. I.M. Bomze Evolution towards the maximum clique J. Global Optimiz. 10 1997 143-164
11. D.G. Corneil D.G. Kirkpatrick A theoretical analysis of various heuristics for the graph isomorphism problem SIAM J. Comput. 9 2 1980 281-297
12. D.G. Corneil R.A. Mathon Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations Ann. Discrete Math. 1 1978 1-32
13. N. Das B.B. Bhattacharya J. Dattagupta Isomorphism of conflict graphs in multistage interconnection networks and its application to optimal routing IEEE Trans. Comput. 42 6 1993 665-677
14. P. Foggia, C. Sasone, M. Vento, A performance comparison of five algorithms for graph isomorphism, in: CUEN (Ed.), Third IAPR-TC-15 Workshop on Graph-based Representations in Pattern Recognition, 2001.
15. K. Fukuda T. Matsui Finding all the perfect matchings in bipartite graphs Appl. Math. Lett. 7 1994 15-18
16. M. Garey D. Johnson Computers and Intractability A Guide to the Theory of NP-Completeness 1979 Freeman New York
17. J. Hofbauer K. Sigmund Evolutionary Games and Population Dynamics 1998 Cambridge University Press UK
18. J.J. Hopfield D.W. Tank Neural computation of decisions in optimization problems Biol. Cybernet. 52 1985 141-152
19. A. Jagota Approximating maximum clique with a Hopfield network IEEE Trans. Neural Networks 6 1995 724-735
20. B.J. Jain, F. Wysotzki, The maximum ω-clique problem and the Hopfield ω-clique model, submitted for publication.
21. B.J. Jain, F. Wysotzki, A competitive winner-takes-all architecture for classification and pattern recognition of structures, in: E. Hancock, M. Vento (Eds.), Graph Based Representations in Pattern Recognition, Fourth IAPR International Workshop, GbRPR 2003, Lecture Notes in Computer Science 2726, Springer, Berlin, 2003, pp. 259-270.
22. B.J. Jain, F. Wysotzki, A k-winner-takes-all classifier for structured data, in: A. Günter, R. Kruse, B. Neumann (Eds.), KI 2003: Advances in Artificial Intelligence, 26th Annual Conference on AI, Lecture Notes in Artificial Intelligence 2821, Springer, Berlin, 2003, pp. 342-354.
23. M. Klin, Ch. Rücker, G. Rücker, G. Tinhofer. Algebraic combinatorics in mathematical chemistry methods and algorithms. I. Permutation groups and coherent (Cellular) algebras, Commun. Math. Comput. Chem. (1999) 1-138.
24. G. Levi A note on the derivation of maximal common subgraphs of two directed or undirected graphs Calcolo 9 1972 341-352
25. B.D. McKay Practical graph isomorphism Congressus Numerantium 30 1981 45-87
26. H.L. Morgan The generation of a unique machine description for chemical structures J. Chem. Doc. 5 1965 107-112
27. T.S. Motzkin E.G. Strauss Maxima for graphs and a new proof of a theorem of Turan Can. J. Math. 17 1965 533-540
28. M. Pelillo Replicator equations, maximal cliques, and graph isomorphism Neural Comput. 11 8 1999 1933-1955
29. M. Pelillo K. Siddiqi S.W. Zucker Matching hierarchical structures using association graphs IEEE Trans. Pattern Anal. Mach. Intell. 21 11 1999 1105-1120
30. A. Rangarajan S. Gold E. Mjolsness A novel optimizing network architecture with applications Neural Comput. 8 5 1996 1041-1060
31. A. Rangarajan E. Mjolsness A Lagrangian relaxation network for graph matching IEEE Trans. Neural Networks 7 6 1996 1365-1381
32. A.C. Rao D.V. Raju Application of the hamming number technique to detect isomorphism among kinematic chains and inversions Mech. Mach. Theory 26 1 1991 55-75
33. J.W. Raymond E.J. Gardiner P. Willett Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm J. Chem. Inform. Comput. Sci. 42 2 2002 305-316
34. R.C. Read, D.G. Corneil, The graph isomorphism disease, J. Graph Theory (1977) 339-363.
35. K. Schädler F. Wysotzki Comparing structures using a Hopfield-style neural network Appl. Intell. 11 1999 15-30
36. P.D. Simic Constrained nets for graph matching and other quadratic assignement problems Neural Comput. 3 1991 268-281
37. A. Srinivasan, S. Muggleton, R. King, M. Sternberg, Mutagenesis: ILP experiments in a non-determinate biological domain, in: S. Wrobel (Ed.), Proceedings of the Fourth International Workshop on Inductive Logic Programming, Number 237 in GMD Studien, 1994, pp. 217-232.
38. J.R. Ullman An algorithm for subgraph isomorphism J. ACM 23 1 1976 31-42
39. S. Umeyama An eigen decomposition approach to weighted graph matching problems IEEE Trans. Pattern Anal. Mach. Intell. 10 5 1998 695-703
40. B.J. van Wyk M.A. van Wyk T.S. Durrani A rkhs interpolator-based graph matching algorithm IEEE Trans. Pattern Anal. Mach. Intell. 24 7 2003 988-995
41. J. Xu GMA: A generic match algorithm for structural homomorphism, isomorphism, and maximal common substructure match and its applications J. Chem. Inform. Comput. Sci. 36 1 1996 25-34
42. L. Xu I. King A PCA approach for fast retrieval of structural patterns in attributed graphs IEEE Trans. Systems, Man, Cybernet. Part B 31 5 2001 812-817