A new graphy triconnectivity algorithm and its parallelization

Authors:
G. Miller;V. Ramachandran
Affiliations:
University of Southern California, Los Angeles, CA;University of Illinois, Urbana, IL
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 3
Cited 6

Parallel ear decomposition search (EDS) and st-numbering in graphs

Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
Graph Algorithms

Graph Algorithms

A randomized parallel algorithm for planar graph isomorphism

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the number of minimum size separating vertex sets in a graph and how to find all of them

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing

IEEE Transactions on Parallel and Distributed Systems
Improved algorithms for graph four-connectivity

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A simple algorithm for triconnectivity of a multigraph

CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm for finding the tri-connected components of an undirected graph. The algorithm is based on ear decomposition and has linear sequential running time. It also has a parallel implementation on a CRCW PRAM with O(log2n) parallel time using a linear number of processors, where n is the number of vertices in the graph. This is the first efficient parallel algorithm for graph tri-connectivity.