On Finding Minimal 2-Connected Subgraphs

Authors:
Pierre Kelsen;Vijaya Ramachandran
Affiliations:
-;-
Venue:
On Finding Minimal 2-Connected Subgraphs
Year:
1990

Citing 0
Cited 1

On finding minimal 2-connected subgraphs

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present efficient parallel algorithms for the problems of finding a minimal 2-edge-connected spanning subgraph of a 2-edge-connected graph and finding a minimal biconnected spanning subgraph of a biconnected graph. The parallel algorithms for both problems run in polylog time using a linear number of PRAM processors. We also give sequential algorithms for these problems that run in time O(m+n log n) where n and m denote the number of vertices and edges, respectively, in the input graph.