Fastest Breadth-First Search and Centrality Computation on GPUs.

Hi All,

We have implemented and open sourced one GPU based BFS which is almost one order of magnitude faster than PPoPP '12 Scalable GPU Graph Traversal.

The source can be found here: https://github.com/iHeartGraph/Enterprise
And the paper is “[SC '15] Enterprise: Breadth-First Graph Traversal on GPUs”

Beyond that, we also published another work called iBFS [SIGMOD '16] which is very good for centrality computation.
The source can be found here: https://github.com/iHeartGraph/iBFS.
And the paper is “[SIGMOD '16] iBFS: Concurrent Breadth-First Search on GPUs”