@inproceedings{2421e57ca9014987a0e352e0e1707455,

title = "Optimal augmentation for bipartite componentwise biconnectivity in linear time",

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.",

author = "Hsu, {Tsan Sheng} and Kao, {Ming Yang}",

year = "1996",

month = jan,

day = "1",

language = "English (US)",

isbn = "3540620486",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "213--222",

editor = "Hiroshi Nagamochi and Satoru Miyano and Tetsuo Asano and Yoshihide Igarashi and Subhash Suri",

booktitle = "Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings",

address = "Germany",

note = "7th International Symposium on Algorithms and Computation, ISAAC 1996 ; Conference date: 16-12-1996 Through 18-12-1996",

}