
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
The girth of a graph is the length of its shortest cycle. Due to its rel...
read it

A Simple PrimalDual Approximation Algorithm for 2EdgeConnected Spanning Subgraphs
We propose a very simple and natural approximation algorithm for the pro...
read it

The 11 algorithm for Travelling Salesman Problem
The Travelling Salesman Problem (TSP), finding a minimal weighted Hamilt...
read it

Topk Connected Overlapping Densest Subgraphs in Dual Networks
Networks are largely used for modelling and analysing data and relations...
read it

Exact Algorithms for Finding WellConnected 2Clubs in RealWorld Graphs: Theory and Experiments
Finding (maximumcardinality) "cliquish" subgraphs is a central topic in...
read it

On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms
Detecting dense subgraphs from large graphs is a core component in many ...
read it

FastSV: A DistributedMemory Connected Component Algorithm with Fast Convergence
This paper presents a new distributedmemory algorithm called FastSV for...
read it
An Efficient Parallel Algorithm for finding Bridges in a Dense Graph
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.
READ FULL TEXT
Comments
There are no comments yet.