Results 1 
1 of
1
Optimal Augmentation For Bipartite Componentwise Biconnectivity In Linear Time
, 1996
"... . 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 impo ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. 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 lineartime algorithm for the problem. Key words. algorithm, linear time, bipartite graph augmentation, biconnectivity, data security AMS(MOS) subject classifications. 68Q20, 68R10, 94C15, 05C40, 05C90 1. Introduction. The problem of adding the minimum number of edges to make a given graph biconnected is called the smallest biconnectivity augmentation problem. This problem has been extensively studied for general graphs [4, 17, 18]. A simplified sequential algorithm which corrects an error in [18] and an efficient parallel algorithm are reported in [13]. Efficient algorithms for other v...