How to match a node of graph X with the same node in graph G if:
Every node has only one feature: text string, and
Nodes in different graphs are considered to be equal if:
2.1 Nodes have the same value of text feature, and 2.2 Nodes have the same edges connecting them to the same neighbours
For example:
G = {S1, S2, S3}
X = {S4, S5, S2, S6}
S2 = {N1, N2, N3, N4}
where:
G - is a directed graph that has S1, S2 and S3 subgraphs
X - is another directed graph that has S4, S5, S2 and S6 subgraphs
N1,.., N4 - are S2 nodes
G subgraph connections: S1 -> S2; S1 -> S3
X subgraph connections: S4 -> S5 -> S2; S5 -> S6
In general case X subgraph connections are not known, we only assume that X has S2 subgraph with a N3 node that we want to find. In this example X also has S4, S5, and S6 subgraphs that we don't care about. These subgraphs are used here just to illustrate a fact that X may be quite different from G.
Task: Find N3 node in X graph.
Is it possible to train Graph Convolutional Network (GCN) or GNN of another type to solve this problem in general?
Please, advise on direction of research to to solve this problem.