Improving Betweenness Centrality Algorithm Performance with Hybrid Parallelism using OpenMP and CUDA
Calculating betweenness centrality in a graph to measure the significance of a node is considered computationally heavy. The expansion rate of today’s graphs in sizeandpropertypushesanalyststofind a more efficient way to calculate BC. One of the methods that can be widel...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/43708 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |