Towards more precise parallel biconnectivity approximation

  • Ka Wong Chong
  • Tak Wah Lam
Session 6a: Invited Presentation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1178)


The problem of finding a minimum biconnected spanning subgraph of an undirected graph is NP-hard. This paper, improving a chain of work [1, 10, 3, 4], gives the first NC algorithm for approximating a minimum biconnected subgraph with an approximation factor approaching 3/2. This result matches the performance of the currently best sequential approximation algorithm [7].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Cheriyan and R. Thurimella, Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates, STOC, 1991, pp. 391–401.Google Scholar
  2. 2.
    K.W. Chong and T.W. Lam, Finding Connected Components in O(log n loglog n) time on the EREW PRAM, Journal of Algorithms, 1995, pp. 378–402.Google Scholar
  3. 3.
    K.W. Chong and T.W. Lam, Approximating Biconnectivity in Parallel, SPAA, 1995, pp. 224–233.Google Scholar
  4. 4.
    K.W. Chong and T.W. Lam, Improving Biconnectivity Approximation via Local Optimization, SODA, 1996, pp. 26–35.Google Scholar
  5. 5.
    T. Fischer, A.V. Goldberg, D.J. Haglin, and S. Plotkin, Approximating Matchings in Parallel, Information Processing Letter, 46(1993), pp. 115–118.CrossRefGoogle Scholar
  6. 6.
    M.R. Garey and D.B. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1978.Google Scholar
  7. 7.
    N. Garg, V.S. Santosh, and A. Singla, Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques, SODA, 1993, pp. 103–111.Google Scholar
  8. 8.
    R.M. Karp and V. Ramachandran, Parallel Algorithms for Shared-Memory Machines, Handbook of Theoretical Computer Science, vol A, J. van Leeuwen Ed., MIT Press, Massachusetts, 1990, pp. 869–941.Google Scholar
  9. 9.
    V. Vazirani, Parallel graph matching, Synthesis of Parallel Algorithms, J.H. Reif Ed., Morgan Kaufmann, San Mateo, CA, 1991.Google Scholar
  10. 10.
    P. Kelsen and V. Ramachandran, On Finding Minimal 2-Connected Subgraphs, Journal of Algorithms, 1995, pp. 1–49.Google Scholar
  11. 11.
    S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of ACM, Vol. 41 No. 2, 1994, pp. 214–235.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Ka Wong Chong
    • 1
  • Tak Wah Lam
    • 1
  1. 1.Department of Computer ScienceUniversity of Hong KongHong Kong

Personalised recommendations