I have an graph: all edges have their own weights, N special nodes have weights.
Then I want to compute K important (central) nodes that are related to N special nodes using Social Network Analysis. My output most be K nodes that do'nt include N special nodes.
What is the best solution for me?
Tags: analysis, centrality, network, social
-
▶ Reply to This