Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)

Authors:
Pei-Chi Huang;Hsin-Wen Wei;Wan-Chen Lu;Wei-Kuan Shih;Tsan-Sheng Hsu
Affiliations:
Department of Computer Science, National Tsing-Hua University, Hsinchu, Taiwan;Department of Computer Science, National Tsing-Hua University, Hsinchu, Taiwan;Department of Computer Science, National Tsing-Hua University, Hsinchu, Taiwan;Department of Computer Science, National Tsing-Hua University, Hsinchu, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 13
Cited 0

A graph theoretic approach to statistical data security

SIAM Journal on Computing
Security-control methods for statistical databases: a comparative study

ACM Computing Surveys (CSUR)
Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Graph augmentation and related problems: theory and practice

Graph augmentation and related problems: theory and practice
Linear-time optimal augmentation for componentwise bipartite-completeness of graphs

Information Processing Letters
Data Security Equals Graph Connectivity

SIAM Journal on Discrete Mathematics
Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables

SIAM Journal on Computing
Edge-Connectivity Augmentation with Partition Constraints

SIAM Journal on Discrete Mathematics
Suppressing marginal totals from a two-dimensional table to protect sensitive information

Statistics and Computing
Censoring Statistical Tables to Protect Sensitive Information: Easy and Hard Problems

SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Security Problems for Statistical Databases with General Cell Suppressions

SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time

SIAM Journal on Discrete Mathematics
Inference Controls for Statistical Databases

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses two augmentation problems related to bipartite graphs. The first, a fundamental graph-theoretical problem, is how to add a set of edges with the smallest possible cardinality so that the resulting graph is 2-edge-connected, i.e., bridge-connected, and still bipartite. The second problem, which arises naturally from research on the security of statistical data, is how to add edges so that the resulting graph is simple and dose not contain any bridges.