Skip to main content
SpringerLink
Log in

Optimal bi-level augmentation for selective! enhancing graph connectivity with applications

  • Session 5
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1996)

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

Included in the following conference series:

Abstract

Given an undirected graph G and two vertex subsets H 1 and H 2, the smallest bi-level augmentation problem is that of adding to G the smallest number of edges such that G contains two internally vertex-disjoint paths between every pair of vertices in H 1 and two edgedisjoint paths between every pair of vertices in H 2. We solve the bi-level augmentation problem in O(n + m) time, where n and m are the numbers of vertices and edges in G. Our algorithm can be parallelized to run in O(log2 n) time using n + m processors on an EREW PRAM.

Research supported in part by NSC of ROC Grant 85-2213-E-001-003.

Research supported in part by NSF Grant CCR-9101385.

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

Access this chapter

Log in via an institution

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. Comput., 5 (1976), pp. 653–665.

    Google Scholar 

  2. A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Disc. Math., 5 (1992), pp. 25–43.

    Google Scholar 

  3. H. Frank and W. Chou, Connectivity considerations in the design of survivable networks, IEEE Trans, on Circuit Theory, CT-17 (1970), pp. 486–490.

    Google Scholar 

  4. D. Gusfield, Optimal mixed graph augmentation, SIAM J. Comput., 16 (1987), pp. 599–612.

    Google Scholar 

  5. -, A graph theoretic approach to statistical data security, SIAM J. Comput., 17 (1988), pp. 552–571.

    Google Scholar 

  6. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.

    Google Scholar 

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

    Google Scholar 

  8. T.-S. Hsu and M. Y. Kao, Optimal augmentation for bipartite componentwise biconnectivity in linear time. Manuscript, 1995.

    Google Scholar 

  9. T.-s. Hsu and V. Ramachandran, On finding a smallest augmentation to biconnect a graph, SIAM J. Comput., 22 (1993), pp. 889–912.

    Google Scholar 

  10. S. P. Jain and K. Gopal, On network augmentation, IEEE Trans, on Reliability, R-35 (1986), pp. 541–543.

    Google Scholar 

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

    Google Scholar 

  12. M. Y. Kao, Data security equals graph connectivity, SIAM Journal on Discrete Mathematics, (1995). To appear.

    Google Scholar 

  13. -, Linear-time optimal augmentation for componentwise bipartitecompleteness of graphs, Information Processing Letters, (1995), pp. 59–63.

    Google Scholar 

  14. -, Total protection of analytic invariant information in cross tabulated tables, SIAM J. Comput., (1995). To appear.

    Google Scholar 

  15. F. M. Malvestuto, M. Moscarini, and M. Rafanelli, Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table, in Proceedings of ACM Symposium on Principles of Database Systems, 1991, pp. 252–258.

    Google Scholar 

  16. A. Rosenthal and A. Goldner, Smallest augmentations to biconnect a graph, SIAM J. Comput., 6 (1977), pp. 55–66.

    Google Scholar 

  17. K. Steiglitz, P. Weiner, and D. J. Kleitman, The design of minimum-cost survivable networks, IEEE Trans, on Circuit Theory, CT-16 (1969), pp. 455–460.

    Google Scholar 

  18. S. Taoka and T. Watanabe, Minimum augmentation to k-edge-connect specified vertices of a graph, in ISAAC'94, vol. LNCS #834, Springer-Verlag, 1994, pp. 217–225.

    Google Scholar 

  19. T. Watanabe, Y. Higashi, and A. Nakamura, An approach to robust network construction from graph augmentation problems, in Proc. of 1990 IEEE Int'l Symp. on Circuits and Systems, 1990, pp. 2861–2864.

    Google Scholar 

  20. -, Graph augmentation problems for a specified set of vertices, in Proc. 1st Annual Int'l Symp. on Algorithms, vol. LNCS #450, Springer-Verlag, 1990, pp. 378–387.

    Google Scholar 

  21. T. Watanabe, T. Watanabe, S. T. Taoka, and T. Mashima, Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph, in Proc. of 1993 IEEE Int'l Symp. on Circuits and Systems, 1993, pp. 2311–2314.

    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, Duke University, 27706, Durham, NC, 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

Editor information

Jin-Yi Cai Chak Kuen Wong

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hsu, Ts., Kao, MY. (1996). Optimal bi-level augmentation for selective! enhancing graph connectivity with applications. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_150

Download citation

  • DOI: https://doi.org/10.1007/3-540-61332-3_150

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61332-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation