David A. Bader
David A. Bader
Home
People
Posts
Projects
Books
Publications
Talks
Contact
Light
Dark
Automatic
Parallel Algorithms
Faster Betweenness Centrality Based on Data Structure Experimentation
Betweenness centrality is a graph analytic that states the importance of a vertex based on the number of shortest paths that it is on. …
Oded Green
,
David A. Bader
PDF
Cite
DOI
GPU Merge Path: A GPU Merging Algorithm
Graphics Processing Units (GPUs) have become ideal candidates for the development of fine-grain parallel algorithms as the number of …
Oded Green
,
Robert McColl
,
David A. Bader
PDF
Cite
DOI
Cite
×