Large Scale Graph Matching(LSGM): Techniques, Tools, Applications and Challenges

Large Scale Graph Matching (LSGM) is one of the fundamental problems in Graph theory and it has applications in many areas such as Computer Vision, Machine Learning, Pattern Recognition and Big Data Analytics (Data Science). Matching belongs to the combinatorial class of problems which refers to finding correspondence between the nodes of a graph or among set of graphs (subgraphs) either precisely or approximately. Precise Matching is also known as Exact Matching such as (sub)Graph Isomorphism and Approximate Matching is called Inexact Matching in which matching activity concerns with conceptual/semantic matching rather than focusing on structural details of graphs. In this article, a review of matching problem is presented i.e. Semantic Matching (conceptual), Syntactic Match-ing (structural) and Schematic Matching (Schema based). The aim is to present the current state of the art in Large Scale Graph Matching (LSGM), a systematic review of algorithms, tools and techniques along with the existing challenges of LSGM. Moreover, the potential application domains and related research activities are provided.

@article{Mahmood2017,
  title     = {Large Scale Graph Matching(LSGM): Techniques, Tools, Applications and Challenges},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {8},
  number    = {4},
  year      = {2017},
  publisher = {The Science and Information Organization},
  author    = {Azka Mahmood and Hina Farooq and Javed Ferzund},
  doi       = {10.14569/IJACSA.2017.080465},
  url       = {https://doi.org/10.14569/IJACSA.2017.080465}
}