Augmenting edge and vertex connectivities simultaneously

  • Ishii Toshimasa
  • Nagamochi Hiroshi
  • Ibaraki Toshihide
Session 3A
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1350)


Given an undirected multigraph G = (V, E) and requirement functions rλ : ( 2 χ ) → Z+ and rκ : ( 2 χ ) Z+ (where Z+ is the set of nonnegative integers), we consider the problem of augmenting G by the smallest number of new edges so that the edge-connectivity and vertex connectivity between every pair χ, γ ε V become at least rλ (χ, γ) and r k ,(χ,γ), respectively, in the resulting graph G′. In this paper, we show that the problem can be solved in polynomial time if rk is given by rk,(χ, γ) = 2 for all χ, γ ε V.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G.-R. Cai and Y.-G. Sun, The minimum augmentation of any graph to k-edge-connected graph, Networks, Vo1.19, 1989, pp. 151–172.Google Scholar
  2. [2]
    K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Computing, Vol.5, 1976, pp. 653–665.Google Scholar
  3. [3]
    A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Mathematics, Vol.5, 1992, pp. 25–53.Google Scholar
  4. [4]
    H.N. Gabow, Applications of a poset representation to edge connectivity and graph rigidity, Proc. 32nd IEEE Symp. Found. Comp. Sci., 1991, pp.812–821.Google Scholar
  5. [5]
    H.N. Gabow, Efficient splitting off algorithms for graphs, Proceedings 26th ACM Symposium on Theory of Computing, 1994, pp. 696–705.Google Scholar
  6. [6]
    A.V. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, Proceedings 18th ACM Symposium on Theory of Computing, 1986, pp. 136–146.Google Scholar
  7. [7]
    T. Hsu and V. Ramachandran, A linear time algorithm for triconnectivity augmentation, Proc. 32nd IEEE Symp. Found. Comp. Sci., 1991, pp.548–559.Google Scholar
  8. [8]
    T. Hsu and V. Ramachandran, Finding a smallest augmentation to biconnect a graph, SIAM J. Computing, Vol.22, 1993, pp.889–912.Google Scholar
  9. [9]
    T. Hsu, Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation, Lecture Notes in Computer Science 920, Springer-Verlag, 6th ISAAC, 1995.Google Scholar
  10. [10]
    T. Ishii, H. Nagamochi, and T. Ibaraki, Augmenting edge-connectivity and vertex-connectivity simultaneously, Technical Report, Department of Applied Mathematics and Physics, Kyoto University, 1997.Google Scholar
  11. [11]
    T. Jordän, On the optimal vertex-connectivity augmentation, J. Combinatorial Theory, Series B, Vol.63, 1995, pp.8–20.Google Scholar
  12. [12]
    T. Jordán, Some remarks on the undirected connectivity, working paper, 1996.Google Scholar
  13. [13]
    W. Mader, A reduction method for edge-connectivity in graphs, Ann. Discrete Math., Vol.3, 1978, pp. 145–164.Google Scholar
  14. [14]
    H. Nagamochi and T. Ibaraki, Deterministic ≈O(m) time edge-splitting in undirected graphs, Proceedings 28th ACM Symposium on Theory of Computing, 1996, pp. 64–73 (in J. Combinatorial Optimization, 1, (1997), pp. 5–46).Google Scholar
  15. [15]
    T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, J. Comp. System Sci., Vol.35, 1987, pp.96–144.Google Scholar
  16. [16]
    T. Watanabe and A. Nakamura, A smallest augmentation to 3-connect a graph, Discrete Appl. Math., Vol.28, 1990, pp.183–186.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Ishii Toshimasa
    • 1
  • Nagamochi Hiroshi
    • 1
  • Ibaraki Toshihide
    • 1
  1. 1.Department of Applied Mathematics and Physics Graduate School of EngineeringKyoto UniversityKyotoJapan

Personalised recommendations