Finding k-Highest Betweenness Centrality Vertices in Graphs
The betweenness centrality is a measure for the relative participation of the vertex in the shortest paths in the graph. In many cases, we are interested in the k-highest betweenness centrality vertices only rather than all the vertices in a graph. In this paper, we study an efficient algorithm for finding the exact k-highest betweenness centrality vertices.
- Issue Date
- 2014-04-09
- Language
- English
- Citation
23rd International Conference on World Wide Web, WWW 2014, pp.339 - 340
- Appears in Collection
- CS-Conference Papers(학술회의논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 6 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.