Re: Betweenness Centrality Computation for just one node instead of the entire graph

[Suhas Bhairav <suhasbhairav AT gmail.com>]

Hi,

I'm making use of pagerank as well. But betweenness is also very important for me.

On Aug 26, 2016 5:14 AM, "guilhelm savin" <guilhelm.savin AT gmail.com> wrote:

Hi,

Computing for one node or for all nodes will not make a big difference. In both cases you have to compute all the shortest paths in the graph, and this part is the big deal for the algorithm complexity.

Betweenness is not the only centrality algorithm. Is it mandatory for you to use it ? You can try the PageRank algorithmfor example, it uses iterations so you can stop at a desired precision.

Cheers.

2016-08-26 3:05 GMT+08:00 Suhas Bhairav <suhasbhairav AT gmail.com>:

Hi All,

I'm generating a very large graph where number of nodes are greater than 500,000. I'm facing trouble while calculating betweenness centrality. It's taking a very long time to compute betweenness centrality for the entire graph. Is it not possible to calculate it just for one node when we need rather than for the entire graph?

Regards

Suhas Bhairav

--

Guilhelm Savin
PhD of Computer Science

+61 404 520 211

\/\/\/\/\/\/

http://gsav.in

http://nomadogeeks.com
http://graphstream-project.org

/\/\/\/\/\/\