Skip to main content
SpringerLink
Log in

Simpler and Faster Vertex-Connectivity Augmentation Algorithms

(Extended Abstract)

  • Conference paper
  • First Online:
Algorithms - ESA 2000 (ESA 2000)

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

Included in the following conference series:

Abstract

This paper presents a new technique to solve the problem of adding a minimum number of edges to an undirected graph in order to obtain a k-vertex-connected resulting graph, for k = 2 and 3.

Research supported in part by NSC grants 88-2213-E-001-026 and 89-2213-E-001-015.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. W. Chong and T. W. Lam. Finding connected components in O(log n log log n) time on the EREW PRAM. In Proceedings of SODA, pages 11–20, 1993.

    Google Scholar 

  2. R. Cole and U. Vishkin. Approximate parallel scheduling. Part II: Applications to logarithmic-time optimal graph algorithms. Information and Computation, 92:1–47, 1991.

    MATH  MathSciNet  Google Scholar 

  3. G. Di Battista and R. Tamassia. On-line graph algorithms with SPQR-trees. Algorithmica, 15:302–318, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. K. P. Eswaran and R. E. Tarjan. Augmentation problems. SIAM Journal on Computing, 5:653–665, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Frank. Connectivity augmentation problems in network design. In J. R. Birge and K. G. Murty, editors, Mathematical Programming: State of the Art 1994, pages 34–63. The University of Michigan, 1994.

    Google Scholar 

  6. D. Fussel, V. Ramachandran, and R. Thurimella. Finding triconnected components by local replacements. SIAM Journal on Computing, 22(3):587–616, 1993.

    Article  MathSciNet  Google Scholar 

  7. F. Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1969.

    Google Scholar 

  8. J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing, 2:135–158, 1973.

    Article  MathSciNet  Google Scholar 

  9. T.-s. Hsu. Graph Augmentation and Related Problems: Theory and Practice. PhD thesis, University of Texas at Austin, 1993.

    Google Scholar 

  10. T.-s. Hsu. Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract). In Springer-Verlag LNCS Vol. 1004: Proceedings of 6th Intl. Symp. on Alg. and Comp., pages 274–283, 1995.

    Google Scholar 

  11. T.-s. Hsu. On four-connecting a triconnected graph. Journal of Algorithms, 35:202–234, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  12. T.-s. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. In Proceedings of FOCS, pages 548–559, 1991.

    Google Scholar 

  13. T.-s. Hsu and V. Ramachandran. On finding a smallest augmentation to biconnect a graph. SIAM Journal on Computing, 22:889–912, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  14. T. Jordán. On the optimal vertex connectivity augmentation. Journal of Combinatorial Theory, Series B, 63:8–20, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  15. T.-H. Ma. On the biconnectivity augmentation problem. In Proceedings of CTS Workshop on Combinatorics and Algorithms, pages 66–73. National Center for Theoretical Sciences Taiwan, December 21–23 1998.

    Google Scholar 

  16. J. Plesník. Minimum block containing a given graph. ARCHIV DER MATHEMATIK, XXVII:668–672, 1976.

    Article  Google Scholar 

  17. V. Ramachandran. Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. In J. H. Reif, editor, Synthesis of Parallel Algorithms, pages 275–340. Morgan-Kaufmann, 1993.

    Google Scholar 

  18. A. Rosenthal and A. Goldner. Smallest augmentations to biconnect a graph. SIAM Journal on Computing, 6:55–66, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  19. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146–160, 1972.

    Article  MATH  MathSciNet  Google Scholar 

  20. R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Comput., 14:862–874, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  21. W. T. Tutte. Connectivity in Graphs. University of Toronto Press, 1966.

    Google Scholar 

  22. T. Watanabe and A. Nakamura. A minimum 3-connectivity augmentation of a graph. Journal of Computer and System Science, 46:91–128, 1993.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Science Academia Sinica, Nankang, 11529, Taipei, Taiwan, ROC

    Tsan -sheng Hsu

Authors
  1. Tsan -sheng Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK

    Mike S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hsu, T.s. (2000). Simpler and Faster Vertex-Connectivity Augmentation Algorithms. In: Paterson, M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45253-2_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-45253-2_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41004-1

  • Online ISBN: 978-3-540-45253-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation