Skip to main content
SpringerLink
Log in

A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Given an undirected graph G and two vertex subsets H1 and H2, the bi-level augmentation problem is that of adding to G the smallest number of edges such that the resulting graph contains two internally vertex-disjoint paths between every pair of vertices in H1 and two edge-disjoint paths between every pair of vertices in H2. We present an algorithm to solve this problem in linear time. By properly setting H1 and H2, this augmentation algorithm subsumes existing optimal algorithms for several graph augmentation problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • B. Bollobás, Graph Theory: An Introductory Course, Springer-Verlag: New York, NY, 1979.

    Google Scholar 

  • N. Christofides and C. A. Whitlock, “Network synthesis with connectivity constraints-a survey,” in Proceedings of the 9th IFORS International Conference on Operational Research, 1981, pp. 705-723.

  • K. P. Eswaran and R. E. Tarjan, “Augmentation problems,” SIAM Journal on Computing vol. 5, pp. 653-665, 1976.

    Google Scholar 

  • A. Frank, “Augmenting graphs to meet edge-connectivity requirements,” SIAM Journal on Discrete Mathematics vol. 5, pp. 25-43, 1992.

    Google Scholar 

  • A. Frank, “Connectivity augmentation problems in network design,” in J. R. Birge and K. G. Murty, editors, Mathematical Programming: State of the Art 1994, pp. 34-63. The University of Michigan, 1994.

  • H. Frank and W. Chou, “Connectivity considerations in the design of survivable networks,” IEEE Transactions on Circuit Theory vol. CT-17, pp. 486-490, 1970.

    Google Scholar 

  • D. Gusfield, “A graph theoretic approach to statistical data security,” SIAM Journal on Computing vol. 17, pp. 552-571, 1988.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • T.-s. Hsu and M. Y. Kao, “Optimal augmentation for bipartite componentwise biconnectivity in linear time,” in T. Asano, Y. Igarashi, H. Nagamochi, S. Miyano, and S. Suri, editors, Lecture Notes in Computer Science 1178 : Proceedings of the 7th International Symposium on Algorithms and Computation, pp. 213-222. Springer-Verlag: New York, NY, 1996.

    Google Scholar 

  • T.-s. Hsu and M. Y. Kao, “Security problems for statistical databases with general cell suppressions,” in Proceedings of the 9th International Conference on Scientific and Statistical Database Management, 1997, pp. 155-164.

  • T.-s. Hsu and V. Ramachandran, “A linear time algorithm for triconnectivity augmentation,” in Proceedings of the 32th Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 548-559.

  • T.-s. Hsu and V. Ramachandran, “On finding a smallest augmentation to biconnect a graph,” SIAM Journal on Computing vol. 22, pp. 889-912, 1993.

    Google Scholar 

  • S. P. Jain and K. Gopal, “On network augmentation,” IEEE Transactions on Reliability vol. R-35, pp. 541-543, 1986.

    Google Scholar 

  • G. Kant, Algorithms for Drawing Planar Graphs. PhD thesis, Utrecht University, the Netherlands, 1993.

    Google Scholar 

  • M.Y. Kao, “Linear-time optimal augmentation for componentwise bipartite-completeness of graphs,” Information Processing Letters, pp. 59-63, 1995.

  • M. Y. Kao, “Data security equals graph connectivity,” SIAM Journal on Discrete Mathematics vol. 9, pp. 87-100, 1996.

    Google Scholar 

  • M. Y. Kao, “Total protection of analytic-invariant information in cross-tabulated tables,” SIAM Journal on Computing vol. 26, pp. 231-242, 1997.

    Article  Google Scholar 

  • J. A. La Poutré and J. Westbrook, “Dynamic two-connectivity with backtracking,” in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 204-212.

  • F. M. Malvestuto and M. Moscarini, “Censoring statistical tables to protect sensitive information: Easy and hard problems,” in Proceedings of the 8th International Conference on Scientific and Statistical Database management, 1996, pp. 12-21.

  • F. M. Malvestuto and M. Moscarini, “Suppressing marginal totals from a two-dimensional table to protect sensitive information,” Statistics and Computing vol. 7, pp. 101-114, 1997.

    Article  Google Scholar 

  • F. M. Malvestuto, M. Moscarini, and M. Rafanelli, “Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table,” in Proceedings of the 3rd ACM Symposium on Principles of Database Systems, 1991s, pp. 252-258.

  • M. Rauch, “Improved data structures for fully dynamic biconnectivity,” in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 686-695.

  • A. Rosenthal and A. Goldner, “Smallest augmentations to biconnect a graph,” SIAM Journal on Computing vol. 6, pp. 55-66, 1977.

    Google Scholar 

  • K. Steiglitz, P. Weiner, and D. J. Kleitman, “The design of minimum-cost survivable networks,” IEEE Transactions on Circuit Theory vol. CT-16, pp. 455-460, 1969.

    Google Scholar 

  • S. Taoka and T. Watanabe, “Minimum augmentation to k-edge-connect specified vertices of a graph,” in D. Z. Du and X. S. Zhang, editors, Lecture Notes in Computer Science 834 : Proceedings of the 5th Annual International Symposium on Algorithms and Computation, pp. 217-225, New York, NY, 1994. Springer-Verlag.

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

  • T. Watanabe, Y. Higashi, and A. Nakamura, “An approach to robust network construction from graph augmentation problems,” in Proceedings of 1990 IEEE International Symposium on Circuits and Systems, 1990, pp. 2861-2864.

  • T. Watanabe, Y. Higashi, and A. Nakamura, “Graph augmentation problems for a specified set of vertices,” in T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki, editors, Lecture Notes in Computer Science 450 : Proceedings of the 1st Annual International Symposium on Algorithms, pp. 378-387. Springer-Verlag: New York, NY, 1990.

    Google Scholar 

  • T. Watanabe, S. Taoka, and T. Mashima, ”Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph,” in Proceedings of 1993 IEEE International Symposium on Circuits and Systems, 1993, pp. 2311-2314.

  • J. Westbrook and R. E. Tarjan, “Maintaining bridge-connected and biconnected components on-line,” Algorithmica, vol. 7, nos.5/6, pp. 433-464, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Tsan-sheng Hsu

  2. Department of Computer Science, Yale University, New Haven, CT, 06520, USA

    Ming-Yang Kao

Authors
  1. Tsan-sheng Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming-Yang Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hsu, Ts., Kao, MY. A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. Journal of Combinatorial Optimization 2, 237–256 (1998). https://doi.org/10.1023/A:1009746026508

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009746026508

Search

Navigation