Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality
From MaRDI portal
Publication:4577956
DOI10.1145/3182656zbMath1414.68040arXiv1602.00963OpenAlexW3125347116MaRDI QIDQ4577956
Giancarlo Carbone, Flavio Vella, Massimo Bernaschi
Publication date: 6 August 2018
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.00963
parallel algorithmshortest pathsgraph algorithmsGPU computingbetweenness centralitylarge-scale graphs
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality ⋮ An Adaptive Version of Brandes' Algorithm for Betweenness Centrality ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast approximation of betweenness centrality through sampling
- A faster algorithm for betweenness centrality*
- Fuzzy System Methods in Modeling Gene Expression and Analyzing Protein Networks
- Community structure in social and biological networks
- Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality
- Topology manipulations for speeding betweenness centrality computation
- Better Approximation of Betweenness Centrality
- Approximating Betweenness Centrality
This page was built for publication: Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality