Rajesh
Reputation: 1
Node embeddings for graph query reachability
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?
Upvotes: 0
Views: 57
Answers (0)
Related Questions
- Turing complete graph query languages
- Graph Searching algorithm
- Simple Graph database
- Node2Vec embeddings to global graph features
- An algorithm to check if a vertex is reachable
- Dgraph: Deep graph traversal possible with recurse?
- graph algorithms: reachability from adjacency map
- Reachability in graph - C
- Finding reachable vertices for every vertex in a directed graph
- m-Reachability in graphs