Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1996: Algorithms and Computation pp 223–232Cite as

Towards more precise parallel biconnectivity approximation

  • Session 6a: Invited Presentation
  • Conference paper
  • First Online:

  • 142 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1178))

Abstract

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].

This research was supported by Hong Kong RGC Grant 338/065/0027.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Cheriyan and R. Thurimella, Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates, STOC, 1991, pp. 391–401.

    Google Scholar 

  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. K.W. Chong and T.W. Lam, Approximating Biconnectivity in Parallel, SPAA, 1995, pp. 224–233.

    Google Scholar 

  4. K.W. Chong and T.W. Lam, Improving Biconnectivity Approximation via Local Optimization, SODA, 1996, pp. 26–35.

    Google Scholar 

  5. T. Fischer, A.V. Goldberg, D.J. Haglin, and S. Plotkin, Approximating Matchings in Parallel, Information Processing Letter, 46(1993), pp. 115–118.

    Article  Google Scholar 

  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. 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. 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. V. Vazirani, Parallel graph matching, Synthesis of Parallel Algorithms, J.H. Reif Ed., Morgan Kaufmann, San Mateo, CA, 1991.

    Google Scholar 

  10. P. Kelsen and V. Ramachandran, On Finding Minimal 2-Connected Subgraphs, Journal of Algorithms, 1995, pp. 1–49.

    Google Scholar 

  11. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of ACM, Vol. 41 No. 2, 1994, pp. 214–235.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hong Kong, Hong Kong

    Ka Wong Chong & Tak Wah Lam

Authors
  1. Ka Wong Chong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tak Wah Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chong, K.W., Lam, T.W. (1996). Towards more precise parallel biconnectivity approximation. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009498

Download citation

  • DOI: https://doi.org/10.1007/BFb0009498

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation