On Finding Minimal Two-Connected Subgraphs

@article{Kelsen1995OnFM,
  title={On Finding Minimal Two-Connected Subgraphs},
  author={Pierre Kelsen and Vijaya Ramachandran},
  journal={J. Algorithms},
  year={1995},
  volume={18},
  pages={1-49}
}
Wepresent e cient parallel algorithms for the problems of nding a minimal2-edge-connected spanning subgraph of a 2-edge-connected graph and nding a minimalbiconnected spanning subgraph of a biconnected graph. The parallel algorithms run in polylog time using a linear number of PRAM processors. We also give linear time sequential algorithms for minimally augmenting a spanning tree into a 2-edge-connected or biconnected graph. 
6 Extracted Citations
23 Extracted References
Similar Papers

Referenced Papers

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

An Algorithmic Approach to Extremal Graph Problems

  • X. Han
  • PhD thesis, Department of Computer Sciences…
  • 1991
Highly Influential
7 Excerpts

Dynamic Graph Algorithms and Data Structures

  • J. A. La Poutr e
  • PhD thesis, Department of Computer Sciences,
  • 1991
Highly Influential
4 Excerpts

E cient parallel ear decomposition with applications

  • G. L. Miller, V. Ramachandran
  • Manuscript, January
  • 1986
Highly Influential
4 Excerpts

An e cient parallel biconnectivity algorithm

  • R. E. Tarjan, U. Vishkin
  • SIAM J. Comput., 14:862{874,
  • 1984
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…