Betweenness Centrality : Algorithms and Lower Bounds

Details Betweenness Centrality : Algorithms and Lower Bounds Betweenness Centrality : Algorithms and Lower Bounds

2008-09-11

arxiv.org/abs/0809.1906v2

Computer Science

Data Structures and Algorithms

Scientific paper

One of the most fundamental problems in large scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely used metric to measure the importance of a node in a network. In this paper, we present a randomized parallel algorithm and an algebraic method for computing betweenness centrality of all nodes in a network. We prove that any path-comparison based algorithm cannot compute betweenness in less than O(nm) time.

Affiliated with

Also associated with

No associations

Rating

Betweenness Centrality : Algorithms and Lower Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Betweenness Centrality : Algorithms and Lower Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Betweenness Centrality : Algorithms and Lower Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473417