A Simple Parallel Algorithm for Biconnected Components in Sparse Graphs


In this paper we design and implement an algorithm for finding the biconnected components of a given graph. Our algorithm is based on experimental evidence that finding the bridges of a graph is usually easier and faster in the parallel setting. We use this property to first decompose the graph into independent and maximal 2-edge-connected sub graphs. To… (More)
DOI: 10.1109/IPDPSW.2015.31


10 Figures and Tables

Slides referencing similar topics