A fast GPU algorithm for biconnected components

Finding the articulation points and the biconnected components of an undirected graph has been a problem of huge interest in graph theory. Over the years, several sequential and parallel algorithms have been presented for this problem. Our paper here presents and implements a fast parallel algorithm on GPU which is to the best of our knowledge the first such attempt and also the fastest implementation across architectures. The implementation is on an average 4x faster then the next best implementation. We also apply an edge-pruning technique which results in a further 2x speedup for dense graphs.