DOI:10.20894/IJWT.
Periodicity: Bi Annual.
Impact Factor:
SJIF:4.78 & GIF:0.428
Submission:Any Time
Publisher: IIR Groups
Language: English
Review Process:
Double Blinded

News and Updates

Author can submit their paper through online submission. Click here

Paper Submission -> Blind Peer Review Process -> Acceptance -> Publication.

On an average time is 3 to 5 days from submission to first decision of manuscripts.

Double blind review and Plagiarism report ensure the originality

IJWT provides online manuscript tracking system.

Every issue of Journal of IJWT is available online from volume 1 issue 1 to the latest published issue with month and year.

Paper Submission:
Any Time
Review process:
One to Two week
Journal Publication:
June / December

IJWT special issue invites the papers from the NATIONAL CONFERENCE, INTERNATIONAL CONFERENCE, SEMINAR conducted by colleges, university, etc. The Group of paper will accept with some concession and will publish in IJWT website. For complete procedure, contact us at admin@iirgroups.org

Paper Template
Copyright Form
Subscription Form
web counter
web counter
Published in:   Vol. 1 Issue 2 Date of Publication:   December 2012

Graph Matching Algorithm-Through Isomorphism Detection

L. Ravi,K. Sujitha

Page(s):   54-60 ISSN:   2278-2397
DOI:   10.20894/IJWT.104.001.002.006 Publisher:   Integrated Intelligent Research (IIR)


  1. J.R. Ullman,   "An Algorithm for Subgraph Isomorphism",   Journal of the Associationfor Computing Machinery   ,Vol.23   ,1976
    View Artical

  2. Shinji Umeyama,   "An Eigen decomposition Approach to Weighted Graph Matching Problems",   IEEE Transactions on Pattern Analysis and Machine    ,Vol.10   ,1988
    View Artical

  3. Radu Horaud and Thomas Skordas,   "Structural Matching for Stereo Vision",   Proceedings of Ninth International Conference on P   ,1988
    View Artical

  4. SeogWhan Lee and Jin H. Kim,   "Attributed Stroke Graph Matching for Seal Imprint Verification",   Pattern Recognition Letters   ,Vol.9   ,1989
    View Artical

  5. Whoi-Yul. Kim and Avinash C. Kak,   "3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation",   IEEE Transaction on Pattern Analysis and Machine I   ,Vol.13   ,1991
    View Artical

  6. Si.Wei. Lu, Ying. Ren, and Ching.Y. Suen,   "Hierarchical Attributed Graph Representation and Recognition of Handwritten Chinese Characters",   Pattern Recognition   ,Vol.24   ,1991
    View Artical

  7. E.K. Wong,   "Model Matching in Robot Vision by Subgraph Isomorphism",   Pattern Recognition   ,Vol.25   ,1992
    View Artical

  8. Chang.J. Cho and Jin.H. Kim,   "Recognizing 3-D Objects by Forward Checking Constrained Tree Search",   Pattern Recognition Letters   ,Vol.13   ,1992
    View Artical

  9. H.S. Lee and M.I. Schor,   "Match Algorithms for Generalized Rete Networks",   Artificial Intelligence   ,1992
    View Artical

  10. Dong Su Seong, Ho Sung Kim, and Kyu Ho Park,   "Incremental Clustering of Attributed Graphs",   IEEE Transaction on System, Man, and Cybernetics   ,Vol.23   ,1993
    View Artical

  11. Richard E. Blake,   "Partitioning Graph Matching with Constraints",   Pattern Recognition   ,Vol.27   ,1994
    View Artical

  12. Adrian Pearce, Terry Caelli, and Walter F. Bischof,   "Rule graphs for Graph Matching in Pattern Recognition",   Pattern Recognition   ,Vol.27   ,1994
    View Artical

  13. William J. Christmas,Josef. Kittler, and Maria Petrou,   "Structural Matching in Computer Vision Using Probabilistic Relaxation",   IEEE Transaction on Pattern Analysis and Machine I   ,Vol.17   ,1995
    View Artical

  14. David Eppstein,   "Subgraph Isomorphism in Planar Graphs and Related Problems",   Journal of Graph Algorithms and Applications   ,Vol.3   ,1999
    View Artical

  15. H. Bunke,   "Error Correcting Graph Matching: On the Influence of the Underlying Cost Function",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.21   ,1999
    View Artical

  16. Marcello Pelillo, Member, alee,m Siddiqi, and Steven W. Zucker, Fellow,   "Matching Hierarchical Structures Using Association Graphs",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.21   ,1999
    View Artical

  17. Bruno T.Messmer and Horst Bunke,   "Efficient subgraph isomorphism detection ? a decomposition approach",   IEEE Transactions on Knowledge and Data Engineerin   ,Vol.12   ,2000
    View Artical

  18. Bin Luo and Edwin R. Hancock,   "Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.23   ,2001
    View Artical

  19. Josep Lladoas, Enric Marti, and Juan Josea Villanueva,   "Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.23   ,2001
    View Artical

  20. Vladimir Kolmogorov,   "Blossom V: A new implementation of a minimum cost perfect matching algorithm",   Mathematical Programming Computation   ,2002
    View Artical

  21. S. Bachl. F.-J. Randenburg,D. Gmach,   "Computing and Drawing Isomorphic Subgraphs",   Journal of Graph Algorithms and Applications   ,Vol.8   ,2004
    View Artical

  22. Luigi P.Cordella, Pasquale Foggia, Carlo Sansone,and Mario Vento,   "A(Sub)Graph Isomorphism Algorithm for Matching Large Graphs",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.26   ,2004
    View Artical

  23. Ying Feng, Robert L. Goldstone, Vladimir Menkov,   "A Graph Matching Algorithm and Its Application to Conceptual System Translation",   International Journal on Artificial Intelligence T   ,2004
    View Artical

  24. Huaijun Qiu, Edwin R. Hancock,   "Graph matching and clustering using spectral partitions",   Journal of pattern recognition   ,Vol.23   ,2006
    View Artical

  25. Bin Luo, Richard C.Wilson, and Edwin R. Hancock,   "A spectral approach to learning structural variations in graphs",   The journal of pattern reorganization society, Pub   ,Vol.29   ,2006
    View Artical

  26. Stephane Zampelli1, Yves Deville, Christine Solnon,Sebastien Sorlin, and Pierre Dupont,   "Filtering for Subgraph Isomorphism",   Springer-Verlag Berlin Heidelberg   ,2007
    View Artical

  27. Tiberio S. Caetano, Julian J. McAuley,Li Cheng,Quoc V. Le, and Alex J.Smola,   "Learning Graph Matching",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.31   ,2009
    View Artical

  28. Misael Mongiovi, Raffaele Di Natale, Osalba Giugno, Alfredo Pulvirenti, Alfredo Ferro And Roded Sharan,   "SIGMA: A Set-Cover-Based Inexact Graph Matching Algorithm",   Journal of Bioinformatics and Computational Biolog   ,Vol.8   ,2010
    View Artical

  29. J.R. Ullman,   "An Algorithm for Subgraph Isomorphism",   Journal of the Associationfor Computing Machinery   ,Vol.23   ,Issue 1   ,1976
    View Artical

  30. Shinji Umeyama,   "An Eigen decomposition Approach to Weighted Graph Matching Problems",   IEEE Transactions on Pattern Analysis and Machine    ,Vol.10   ,Issue 5   ,1988
    View Artical

  31. Radu Horaud and Thomas Skordas,   "Structural Matching for Stereo Vision",   Proceedings of Ninth International Conference on P   ,Vol.1   ,Issue 2   ,1988
    View Artical

  32. Whoi-Yul. Kim and Avinash C. Kak,   "3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation",   IEEE Transaction on Pattern Analysis and Machine I   ,Vol.13   ,Issue 3   ,1991
    View Artical

  33. Dong Su Seong, Ho Sung Kim, and Kyu Ho Park,   "Incremental Clustering of Attributed Graphs",   IEEE Transaction on System, Man, and Cybernetics   ,Vol.23   ,Issue 5   ,1993
    View Artical

  34. William J. Christmas,Josef. Kittler, and Maria Petrou,   "Structural Matching in Computer Vision Using Probabilistic Relaxation",   IEEE Transaction on Pattern Analysis and Machine I   ,Vol.17   ,Issue 8   ,1995
    View Artical

  35. David Eppstein,   "Subgraph Isomorphism in Planar Graphs and Related Problems",   Journal of Graph Algorithms and Applications   ,Vol.3   ,Issue 3   ,1999
    View Artical

  36. H. Bunke,   "Error Correcting Graph Matching: On the Influence of the Underlying Cost Function",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.21   ,Issue 9   ,1999
    View Artical

  37. Marcello Pelillo, Member, alee,m Siddiqi, and Steven W. Zucker, Fellow,   "Matching Hierarchical Structures Using Association Graphs",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.21   ,Issue 11   ,1999
    View Artical

  38. Bruno T.Messmer and Horst Bunke,   "Efficient subgraph isomorphism detection ? a decomposition approach",   IEEE Transactions on Knowledge and Data Engineerin   ,Vol.12   ,Issue 2   ,2000
    View Artical

  39. Bin Luo and Edwin R. Hancock,   "Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.23   ,Issue 10   ,2001
    View Artical

  40. Josep Lladoas, Enric Marti, and Juan Josea Villanueva,   "Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.23   ,Issue 10   ,2001
    View Artical

  41. Vladimir Kolmogorov,   "Blossom V: A new implementation of a minimum cost perfect matching algorithm",   Mathematical Programming Computation   ,Vol.1   ,Issue 1   ,2002
    View Artical

  42. S. Bachl. F.-J. Randenburg,D. Gmach,   "Computing and Drawing Isomorphic Subgraphs",   Journal of Graph Algorithms and Applications   ,Vol.8   ,Issue 2   ,2004
    View Artical

  43. Luigi P.Cordella, Pasquale Foggia, Carlo Sansone,and Mario Vento,   "A(Sub)Graph Isomorphism Algorithm for Matching Large Graphs",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.26   ,Issue 10   ,2004
    View Artical

  44. Ying Feng, Robert L. Goldstone, Vladimir Menkov,   "A Graph Matching Algorithm and Its Application to Conceptual System Translation",   International Journal on Artificial Intelligence T   ,Vol.12   ,Issue 2   ,2005
    View Artical

  45. Huaijun Qiu, Edwin R. Hancock,   "Graph matching and clustering using spectral partitions",   Journal of pattern recognition   ,Vol.39   ,Issue 1   ,2006
    View Artical

  46. Bin Luo, Richard C.Wilson, and Edwin R. Hancock,   "A spectral approach to learning structural variations in graphs",   The journal of pattern reorganization society, Pub   ,Vol.39   ,Issue 6   ,2006
    View Artical

  47. Tiberio S. Caetano, Julian J. McAuley,Li Cheng,Quoc V. Le, and Alex J.Smola,   "Learning Graph Matching",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.31   ,Issue 6   ,2009
    View Artical

  48. Misael Mongiovi, Raffaele Di Natale, Osalba Giugno, Alfredo Pulvirenti, Alfredo Ferro And Roded Sharan,   "SIGMA: A Set-Cover-Based Inexact Graph Matching Algorithm",   Journal of Bioinformatics and Computational Biolog   ,Vol.8   ,Issue 2   ,2010
    View Artical

  49. Vladimir Kolmogorov,   "Blossom V: A new implementation of a minimum cost perfect matching algorithm",   Mathematical Programming Computation   ,Vol.1   ,Issue 1   ,2002
    View Artical

  50. Ying Feng, Robert L. Goldstone, Vladimir Menkov,   "A Graph Matching Algorithm and Its Application to Conceptual System Translation",   International Journal on Artificial Intelligence T   ,Vol.14   ,Issue 2   ,2004
    View Artical

  51. Bin Luo, Richard C.Wilson, and Edwin R. Hancock,   "A spectral approach to learning structural variations in graphs",   The journal of pattern reorganization society, Pub   ,Vol.29   ,2006
    View Artical

  52. Tiberio S. Caetano, Julian J. McAuley,Li Cheng,Quoc V. Le, and Alex J.Smola,   "Learning Graph Matching",   IEEE Transactions On Pattern Analysis And Machine    ,Vol.31   ,Issue 6   ,2009
    View Artical

  53. Shinji Umeyama,   "An Eigen decomposition Approach to Weighted Graph Matching Problems",   IEEE Transactions on Pattern Analysis and Machine    ,Vol.10   ,Issue 5   ,1988
    View Artical

  54. SeogWhan Lee and Jin H. Kim,   "Attributed Stroke Graph Matching for Seal Imprint Verification",   Pattern Recognition Letters   ,Vol.9   ,Issue 2   ,1989
    View Artical

  55. Si.Wei. Lu, Ying. Ren, and Ching.Y. Suen,   "Hierarchical Attributed Graph Representation and Recognition of Handwritten Chinese Characters",   Pattern Recognition   ,Vol.24   ,Issue 7   ,1991
    View Artical

  56. E.K. Wong,   "Model Matching in Robot Vision by Subgraph Isomorphism",   Pattern Recognition   ,Vol.25   ,Issue 3   ,1992
    View Artical

  57. Chang.J. Cho and Jin.H. Kim,   "Recognizing 3-D Objects by Forward Checking Constrained Tree Search",   Pattern Recognition Letters   ,Vol.13   ,Issue 8   ,1992
    View Artical

  58. H.S. Lee and M.I. Schor,   "Match Algorithms for Generalized Rete Networks",   Artificial Intelligence   ,Vol.54   ,Issue 3   ,1992
    View Artical

  59. Richard E. Blake,   "Partitioning Graph Matching with Constraints",   Pattern Recognition   ,Vol.27   ,Issue 3   ,1994
    View Artical

  60. Adrian Pearce, Terry Caelli, and Walter F. Bischof,   "Rule graphs for Graph Matching in Pattern Recognition",   Pattern Recognition   ,Vol.27   ,Issue 9   ,1994
    View Artical

  61. Vladimir Kolmogorov,   "Blossom V: A new implementation of a minimum cost perfect matching algorithm",   Mathematical Programming Computation   ,Vol.1   ,Issue 1   ,2002
    View Artical

  62. S. Bachl. F.-J. Randenburg,D. Gmach,   "Computing and Drawing Isomorphic Subgraphs",   Journal of Graph Algorithms and Applications   ,Vol.8   ,2004
    View Artical

  63. Ying Feng, Robert L. Goldstone, Vladimir Menkov,   "A Graph Matching Algorithm and Its Application to Conceptual System Translation",   International Journal on Artificial Intelligence T   ,Vol.14   ,Issue 2   ,2004
    View Artical

  64. Bin Luo, Richard C.Wilson, and Edwin R. Hancock,   "A spectral approach to learning structural variations in graphs",   The journal of pattern reorganization society, Pub   ,Vol.29   ,Issue 6   ,2006
    View Artical

  65. Stephane Zampelli1, Yves Deville, Christine Solnon,Sebastien Sorlin, and Pierre Dupont,   "Filtering for Subgraph Isomorphism",   Springer-Verlag Berlin Heidelberg   ,Vol.    ,2007
    View Artical