Skip to main content

A Subgraph Isomorphism Algorithm Based on Hopfield Neural Network

  • Conference paper
Advances in Neural Networks – ISNN 2004 (ISNN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3173))

Included in the following conference series:

  • 1007 Accesses

Abstract

A subgraph isomorphism algorithm using 2D continuous Hopfield neural network is presented in this paper. Given two graphs G 1 and G 2, the goal is to find a subgraph of G 2 isomorphic to G 1. The rows of the 2D neuron array represent the vertices of G 1, and the columns represent those of G 2. The energy function is defined. The network parameters are deduced from the energy function. The neurons are initialized based on the necessary conditions for subgraph isomorphism. The motion equation is solved using the fourth order Runge-Kutta method. Experimental results show the correctness and validity of the algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness. Freeman & Co., New York (1979)

    MATH  Google Scholar 

  2. Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. Journal of the Association for Computing Machinery 23, 31–42 (1976)

    MathSciNet  Google Scholar 

  3. Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs. Computing 61(12), 43–52 (1998)

    MathSciNet  Google Scholar 

  4. Messmer, B.T., Bunke, H.: A Decision Tree Approach to Graph and Subgraph Isomorphism Detection. Pattern Recognition 32, 1979–1998 (1999)

    Article  Google Scholar 

  5. Hopfield, J.J.: Neurons with Graded Response have Collective Computational Properties like Those of Two-State Neurons. Proc. of the National Academy of Sciences 81, 3088–3092 (1984)

    Article  Google Scholar 

  6. Suganthan, P.N., Teoh, E.K., Mital, D.P.: Pattern Recognition by Homomorphic Graph Matching Using Hopfield Networks. Image & Vision Comput. 13, 45–60 (1995)

    Article  Google Scholar 

  7. Funabiki, N., Kitamichi, J.: A Three-Stage Greedy and Neural-Network Approach for the Subgraph Isomorphism Problem. In: IEEE International Conference on Systems, Man and Cybernetics, vol. 2, pp. 1892–1897 (1998)

    Google Scholar 

  8. Lin, W.C., Liao, F.Y., Tsao, C.K., Lingutla, T.: A Hierarchical Multiple-View Approach to Three-Dimensional Object Recognition. IEEE Trans. Neural Networks 2, 84–92 (1991)

    Article  Google Scholar 

  9. Burden, R.L., Faires, J.D.: Numerical Analysis. Brooks/Cole Publishing Company, Monterey (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, E., Wang, X. (2004). A Subgraph Isomorphism Algorithm Based on Hopfield Neural Network. In: Yin, FL., Wang, J., Guo, C. (eds) Advances in Neural Networks – ISNN 2004. ISNN 2004. Lecture Notes in Computer Science, vol 3173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28647-9_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28647-9_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22841-7

  • Online ISBN: 978-3-540-28647-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics