Skip to main content
SpringerLink
Log in

Optimal augmentation for bipartite componentwise biconnectivity in linear time

Extended abstract

  • Session 6a: Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1996)

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

Included in the following conference series:

Abstract

A graph is componentwise fully biconnected if every connected component either is an isolated vertex or is biconnected. We consider the problem of adding the smallest number of edges to make a bipartite graph componentwise fully biconnected while preserving its bipartiteness. This problem has important applications for protecting sensitive information in cross tabulated tables. This paper presents a linear-time algorithm for the problem.

Research supported in part by NSC Grants 84-2213-E-001-005 and 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. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.

    Google Scholar 

  2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  3. K. P. Eswaran and R. E. Tarjan. Augmentation problems. SIAM J. Comput., 5(4):653–665, 1976.

    Article  Google Scholar 

  4. S. Even. Graph Algorithms. Computer Science Press, Rockville, MD, 1979.

    Google Scholar 

  5. D. Gusfield. Optimal mixed graph augmentation. SIAM Journal on Computing, 16:599–612, 1987.

    Article  Google Scholar 

  6. D. Gusfield. A graph theoretic approach to statistical data security. SIAM Journal on Computing, 17:552–571, 1988.

    Article  Google Scholar 

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

    Google Scholar 

  8. T.-s. Hsu. On four-connecting a triconnected graph (extended abstract). In Proc. 33rd Annual IEEE Symp. on Foundations of Comp. Sci., pages 70–79, October 1992.

    Google Scholar 

  9. T.-s. Hsu. Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract). In Proc. 6th International Symp. on Algorithms and Computation, volume LNCS #1004, pages 274–283. Springer-Verlag, 1995.

    Google Scholar 

  10. T.-s. Hsu and M. Y. Kao. Optimal bi-level augmentation for selectively enhancing graph connectivity with applications. In Proc. 2nd International Symp. on Computing and Combinatorics, volume LNCS #1090, pages 169–178. Springer-Verlag, 1996.

    Google Scholar 

  11. T.-s. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. In Proc. 32th Annual IEEE Symp. on Foundations of Comp. Sci., pages 548–559, 1991.

    Google Scholar 

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

    Article  Google Scholar 

  13. M. Y. Kao. Linear-time optimal augmentation for componentwise bipartite-completeness of graphs. Information Processing Letters, pages 59–63, 1995.

    Google Scholar 

  14. M. Y. Kao. Total protection of analytic invariant information in cross tabulated tables. SIAM Journal on Computing, 1995. To appear.

    Google Scholar 

  15. M. Y. Kao. Data security equals graph connectivity. SIAM Journal on Discrete Mathematics, 9:87–100, 1996.

    Article  Google Scholar 

  16. 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, pages 252–258, 1991.

    Google Scholar 

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

    Article  Google Scholar 

  18. A. Rosenthal and A. Goldner. Smallest augmentations to biconnect a graph. SIAM J. Comput., 6(1):55–66, March 1977.

    Article  Google Scholar 

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

    Google Scholar 

  20. T. Watanabe and A. Nakamura. A minimum — connectivity augmentation of a graph. J. Comp. System Sci., 46:91–128, 1993.

    Article  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, 27708, 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

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

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 augmentation for bipartite componentwise biconnectivity in linear time. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009497

Download citation

  • DOI: https://doi.org/10.1007/BFb0009497

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation