Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time

Details Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time

2001-02-10

arxiv.org/abs/cs/0102009v1

Computer Science

Data Structures and Algorithms

A preliminary version appeared in T. Asano, Y. Igarashi, H. Nagamochi, S. Miyano, and S. Suri, editors, Lecture Notes in Compu

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370000