Subgraph Matching Using Graph Neural Network

  • Baskararaja G
  • Manickavasagam M
N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

Subgraph matching problem is identifying a target subgraph in a graph. Graph neural network (GNN) is an artificial neural network model which is capable of processing general types of graph structured data. A graph may contain many subgraphs isomorphic to a given target graph. In this paper GNN is modeled to identify a subgraph that matches the target graph along with its characteristics. The simulation results show that GNN is capable of identifying a target sub-graph in a graph.

Cite

CITATION STYLE

APA

Baskararaja, G. R., & Manickavasagam, M. S. (2012). Subgraph Matching Using Graph Neural Network. Journal of Intelligent Learning Systems and Applications, 04(04), 274–278. https://doi.org/10.4236/jilsa.2012.44028

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free