2-hop neighbourhood graphs for large networks #10332
Unanswered
srushti-03
asked this question in
Q&A
Replies: 0 comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
I want to create 2- hop neighbourhood graphs for large networks having millions of nodes and edges. I am interested in finding the set of common neighbours for each node pair. Can you suggest some techniques / methods to fasten or optimize the process in the best way possible?
Beta Was this translation helpful? Give feedback.
All reactions