# Betweenness centrality updation and community detection in streaming graphs using incremental algorithm

##### Citations

22 citations

12 citations

### Cites methods from "Betweenness centrality updation and..."

...A. Bhandari et al.[12] present a algorithm to compute the betweenness centrality of a node by detecting the community in the network....

[...]

...Bhandari et al.[12] present a algorithm to compute the betweenness centrality of a node by detecting the community in the network....

[...]

10 citations

8 citations

### Cites background from "Betweenness centrality updation and..."

...In graph theory and network analysis, centrality is an indicator for finding important nodes and links (Bhandari et al. 2017; Bonchi et al. 2016; Freeman 1979; Opsahl et al. 2010)....

[...]

...2.2 Network centrality In graph theory and network analysis, centrality is an indicator for finding important nodes and links (Bhandari et al. 2017; Bonchi et al. 2016; Freeman 1979; Opsahl et al. 2010)....

[...]

4 citations

##### References

39,297 citations

### "Betweenness centrality updation and..." refers background in this paper

...The degree of a node signifies that each node or vertex behaves in a different way within the complex network [4, 5, 6] and therefore centrality measures become necessary in such networks to order the vertices (shown in Figure 1)....

[...]

8,026 citations

4,190 citations

### Additional excerpts

...However, after few years in 2001, Brandes[8] proposed a brand new algorithm that reduced the running time of Freeman's approach....

[...]

...Brandes Algorithm for dense network [21] can take O(n3) since m = n(n-1)/2 in the dense graph....

[...]

...[8] U. Brandes, ’A faster algorithm for betweenness centrality’, The Journal of Mathematical Sociology, Vol. 25, No. 2, pp. 163-177, 2001....

[...]

...It has been observed that if the target set S is chosen to be equal to V then this algorithm is almost same as Brandes in terms of speed but if S is less than V; then it takes O(|S|n+|S|nlogn) which would be far better in terms of complexity than O(mn+n2logn)....

[...]

...Brandes approach is the most widely used approach for finding out the betweenness centrality however it's still expensive for growing networks since it takes O(mn+n2logn) amount of time and O(n+m) space however our approach efficiently updates the centrality of the nodes by taking O(|S|n+|S|nlogn) amount of time where |S| is the subset of the vertices,m is the number of edges, n is the number of vertices and |S| ≤ n holds true....

[...]

2,772 citations

### "Betweenness centrality updation and..." refers background or methods in this paper

...In large networks, community structure is first identified by Lancichinetti, [3] he observed that the nodes in the networks are generally group themselves into communities or modules such that the nodes which belong to the same community are similar whereas the nodes which are in different communities show less resemblance with each other....

[...]

...[2] A. Lancichinetti, S. Fortunato and J. Kertesz, ’Detecting the overlapping and hierarchical community structure in complex networks’, New Journal of Physics, Vol. 11, No. 3, 2009....

[...]

..., they are not assigned to any community [2, 3, 4]....

[...]

...Several researchers [1,2,3] have shown that the networks are attributed by the heterogeneous degree distribution of a node that states that the node with the highest degree is placed at the top or is ranked the highest among all the nodes and therefore the one with the least degree is placed at the lowest....

[...]

...The configuration model is used to connect the nodes so to keep their degree sequence [3]....

[...]

2,625 citations