Improved algorithms for graph four-connectivity

Authors:
Arkady Kanevsky;Vijaya Ramachandran
Affiliations:
-;-
Venue:
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Year:
1987

Citing 6
Cited 1

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

Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
A new graphy triconnectivity algorithm and its parallelization

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Graph Algorithms

Graph Algorithms
Computing ears and branchings in parallel

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A physical interpretation of graph connectivity, and its algorithmic applications

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Parallel merge sort

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Well-constrained completion for under-constrained geometric constraint problem based on connectivity analysis of graph

Proceedings of the 2011 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm based on ear decomposition for testing vertex four-connectivity and for finding all separating triplets in a triconnected graph. The sequential implementation of our algorithm runs in O(n2) time and the parallel implementation runs in O(logn) time using O(n2) processors on a CRCW PRAM, where n is the number of vertices in the graph. This improves previous bounds for the problem for both the sequential and parallel cases. The sequential algorithm is optimal if the input is specified in adjacency matrix form, or if the input graph is dense.