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}
}
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

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

V

  • A. Kanevsky
  • Ramachandran, "A characterization of separating…
  • 1987

Lovasz,"Computing ears and branchings in parallel,

  • L. Lo
  • Proc. 26th IEEE Ann. Symp. on Foundations of…
  • 1985

Graph Algorithms

  • S. Even
  • Computer Science Press, Rockville, MD
  • 1979
2 Excerpts

Similar Papers

Loading similar papers…