Export Citations
2 Results for: [Keyword: Betweenness centrality] AND [Book/Issue: Vol 23, Issue null]
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,836,977 records)|Limit your search to The ACM Full-Text Collection (774,400 records)
Showing 1 - 2of2 Results
Select All
- research-articleAugust 2018
Improving the Betweenness Centrality of a Node by Adding Links
- Elisabetta Bergamini,
- Pierluigi Crescenzi,
- Gianlorenzo D'angelo,
- Henning Meyerhenke,
- Lorenzo Severini,
- Yllka Velaj
ACM Journal of Experimental Algorithmics (JEA), Volume 23Article No.: 1.5, Pages 1–32https://doi.org/10.1145/3166071Betweenness is a well-known centrality measure that ranks the nodes according to their participation in the shortest paths of a network. In several scenarios, having a high betweenness can have a positive impact on the node itself. Hence, in this ...
- research-articleMarch 2018
Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality
ACM Journal of Experimental Algorithmics (JEA), Volume 23Article No.: 1.4, Pages 1–19https://doi.org/10.1145/3182656Betweenness Centrality (BC) is a widely used metric of the relevance of a node in a network. The fastest-known algorithm for the evaluation of BC on unweighted graphs builds a tree representing information about the shortest paths for each vertex to ...
