Optimal augmentation for bipartite componentwise biconnectivity in linear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 213-222

  Hsu, Tsan Sheng ^a   Kao, Ming Yang ^b  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^b Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

BICONNECTIVITY; BIPARTITE GRAPHS; BIPARTITENESS; COMPONENTWISE; CONNECTED COMPONENT; ISOLATED VERTICES; LINEAR-TIME ALGORITHMS; SENSITIVE INFORMATIONS;

GRAPH THEORY;

EID: 84990193647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009497     Document Type: Conference Paper

References (20)

1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. 5/lIT Press, Cambridge, MA, 1990.
3. K. P. Eswaran and R. E. Tarjan. Augmentation problems. SIAM J. Comput., 5(4):653-665, 1976.
4. S. Even. Graph Algorithms. Computer Science Press, Rockvflle, MD, 1979.
5. D. Gusfield. Optimal mixed graph augmentation. SIAM Journal on Computing, 16:599-612, 1987.
6. D. Gusfield. A graph theoretic approach to statistical data security. SIAM Journal on Computing, 17:552-571, 1988.
7. F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.
8. T.-S. Hsu. On four-connecting a triconnected graph (extended abstract). In Proc. 33rd Annual IEEE Syrup. on Foundations of Comp. Sci., pages 70-79, October 1992.
9. T.-S. Hsu. Undirected vertex-connectivity structure and smallest four-vertexconnectivity augmentation (extended abstract). In Proc. 6th International Syrup. on Algorithms and Computation, volume LNCS, 1004, pages 274-283. Springer-Verlag, 1995.
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.
11. T.-s. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. In Proc. 32th Annual IEEE Syrup. on Foundations of Comp. Sci., pages 548-559, 1991.
12. T.-s. Hsu and V. Ramachandran. On finding a smallest augmentation to biconnect a graph. SIAM J. Comput., 22(5):889-912, 1993.
13. M. u Kao. Linear-time optimal augmentation for componentwise bipartitecompleteness of graphs. Information Processing Letters, pages 59-63, 1995.
14. M. Y. Kao. Total protection of analytic invariant information in cross tabulated tables. SIAM Journal on Computing, 1995. To appear.
15. M. Y. Kao. Data security equals graph connectivity. SIAM Journal on Discrete Mathematics, 9:87-100, 1996.
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.
17. J. Plesnik. Minimum block containing a given graph. ARCHIV DER MATHEMATIK, XXVII:668-672, 1976.
18. A. Rosenthal and A. Goldner. Smallest augmentations to biconnect a graph. SIAM J. Comput., 6(1):55-66, March 1977.
19. W. T. Tutte. Connectivity in Graphs. University of Toronto Press, 1966.
20. T. Watanabe and A. Nakamura. A minimum 3-connectivity augmentation of a graph. J. Comp. System Sci., 46:91 128, 1993.