QUBE: a quick algorithm for updating betweenness centrality

@inproceedings{Lee2012QUBEAQ,
  title={QUBE: a quick algorithm for updating betweenness centrality},
  author={Min-Joong Lee and Jungmin Lee and Jaimie Yejean Park and Ryan H. Choi and Chin-Wan Chung},
  booktitle={WWW},
  year={2012}
}
The betweenness centrality of a vertex in a graph is a measure for the participation of the vertex in the shortest paths in the graph. The Betweenness centrality is widely used in network analyses. Especially in a social network, the recursive computation of the betweenness centralities of vertices is performed for the community detection and finding the influential user in the network. Since a social network graph is frequently updated, it is necessary to update the betweenness centrality… CONTINUE READING
Highly Cited
This paper has 84 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 54 extracted citations

84 Citations

0102030'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 84 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

A measure of betweenness centrality based on random walks

  • M.E.J. Newman
  • Social Networks,
  • 2005
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…