An Efficient Parallel Algorithm for finding Bridges in a Dense Graph

08/16/2021 ∙ by Ashwani Kumar, et al. ∙ 0

This paper presents a simple and efficient approach for finding the bridges and failure points in a densely connected network mapped as a graph. The algorithm presented here is a parallel algorithm which works in a distributed environment. The main idea of our algorithm is to generate a sparse certificate for a graph and finds bridges using a simple DFS (Depth First Search). We first decompose the graph into independent and minimal subgraphs using a minimum spanning forest algorithm. To identify the bridges in the graph network, we convert these subgraphs into a single compressed graph and use a DFS approach to find bridges. The approach presented here is optimized for the use cases of dense graphs and gives the time complexity of O(E/M + Vlog(M)), for a given graph G(V,E) running on M machines.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.