Skip to main content
SpringerLink
Log in

k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1998)

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

Included in the following conference series:

Abstract

Given an undirected multigraph G = (V,E ) and two positive integers l and k, the edge-and-vertex connectivity augmentation problem asks to augment G by the smallest number of new edges so that the resulting multigraph becomes l-edge-connected and k-vertex-connected. In this paper, we show that the problem with a fixed and k = 3 can be solved in polynomial time for an arbitrary multigraph G

This research was partially supported by the Scientific Grant-in-Aid from Ministry of Education, Science, Sports and Culture of Japan, and the subsidy from the Inamori Foundation.

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. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Compt., 5 1976, 653–665.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAMJ. Disc. Math., 5 1992, 25–53.

    Article  MATH  Google Scholar 

  3. T. Hsu and V. Ramachandran, A linear time algorithm for triconnectivity augmen-tation, Proc. 32nd IEEE Symp. Found. Comp. Sci., 1991, 548–559.

    Google Scholar 

  4. T. Hsu and V. Ramachandran, Finding a smallest augmentation to biconnect a graph, SIAM J. Compt., 22 1993, 889–912.

    Article  MATH  MathSciNet  Google Scholar 

  5. T. Hsu, Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation, LNCS 920, Springer-Verlag, 6th ISAAC, 1995, pp. 274–283.

    Google Scholar 

  6. T. Hsu and M. Kao, Optimal bi-level augmentation for selectively enhancing graph connectivity with applications, LNCS 1090, Springer-Verlag, 2nd COCOON, 1996, 169–178.

    Google Scholar 

  7. T. Ishii, H. Nagamochi, and T. Ibaraki, Augmenting edge-connectivity and vertex-connectivity simultaneously, LNCS, Springer-Verlag, 8th ISAAC 1997, pp. 102–111.

    Google Scholar 

  8. T. Ishii, H. Nagamochi, and T. Ibaraki, Optimal augmentation to make a graph k-edge-connected and triconnected, Proc. of 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 280–289.

    Google Scholar 

  9. L. Lovász, Combinatorial Problems and Exercises, North-Holland, 1979.

    Google Scholar 

  10. T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, J. Comp. System Sci., 35 1987, 96–144.

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Watanabe and A. Nakamura, A smallest augmentation to 3-connect a graph, Disc. Appl. Math., 28 1990, 183–186.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics, Kyoto University, Kyoto, 606-8501, Japan

    Toshimasa Ishii, Hiroshi Nagamochi & Toshihide Ibaraki

Authors
  1. Toshimasa Ishii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusong-dong, Yusong-gu, Taejon, 305-701, Korea

    Kyung-Yong Chwa

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishii, T., Nagamochi, H., Ibaraki, T. (1998). k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation