GraphStream Users

Archives de la liste Aide

Re: Betweenness Centrality through of all nodes with respect to just one node?

Chronologique Discussions 
  • From: guilhelm savin <guilhelm.savin AT>
  • To: "graphstream-users AT" <graphstream-users AT>, Suhas Bhairav <suhasbhairav AT>
  • Cc: "users AT" <users AT>
  • Subject: Re: Betweenness Centrality through of all nodes with respect to just one node?
  • Date: Mon, 4 Jul 2016 18:35:23 +0200


Computing Betweenness Centrality according to one node does not make sense, since BC of a node n is the number of shortest paths containing n divided by the total number of shortest paths.

Of course you can create your own centrality measure, but it will not be BC anymore.
Or I am missing something maybe...


2016-07-04 9:42 GMT+02:00 Suhas Bhairav <suhasbhairav AT>:

The Betweenness Centrality algorithm implemented in graphstream calculates centrality values for all nodes when we specify :

BetweennessCentrality bc = new BetweennessCentrality();

I believe the betweenness centrality value for each node is with respect to all other nodes in the graph. Is it possible to just compute betweenness centrality of all nodes in a graph with respect to just one node in graphstream?

For example: If there are 10 nodes having node id from 1 to 10 in a graph. When we calculate betweenness centrality of the entire graph, each node's betweenness value is with respect to every other node in the graph. Instead, I was wondering if there is a provision to compute betweenness value of each node through just one specific node.

Suhas Bhairav

Guilhelm Savin
PhD of Computer Science

Archives gérées par MHonArc 2.6.16.

Top of page