# Subgraph Matching Using Graph Neural Network

@inproceedings{Baskararaja2013SubgraphMU, title={Subgraph Matching Using Graph Neural Network}, author={GnanaJothi Raja Baskararaja and M. Manickavasagam}, year={2013} }

- Published 2013

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 subgraph in a graph.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-8 of 8 references

## Computational Capabilities of Graph Neural Networks

View 1 Excerpt

## The Graph Neural Network Model

View 3 Excerpts

## Ant Colony Optimization for Multivalent Graph Matching Problems

View 1 Excerpt

## Applications of Graph Neural Networks to Large-Scale Recommender Systems Some Results

View 1 Excerpt

## Subgraph Matching with Semidefinite Programming

View 1 Excerpt