Highly Influenced

# Improved algorithms for graph four-connectivity

@article{Kanevsky1987ImprovedAF, title={Improved algorithms for graph four-connectivity}, author={Arkady Kanevsky and Vijaya Ramachandran}, journal={28th Annual Symposium on Foundations of Computer Science (sfcs 1987)}, year={1987}, pages={252-259} }

- Published 1987 in 28th Annual Symposium on Foundations of Computer…
DOI:10.1016/0022-0000(91)90004-O

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… CONTINUE READING