Node embeddings for graph query reachability

51 views Asked by At

Can we use node embeddings for graph query reachability? For example, we have a directed graph (G). First, we will calculate the Node embeddings.

Can we check whether node u is reachable to node v using these node embeddings?

0

There are 0 answers