Optimal augmentation for bipartite componentwise biconnectivity in linear time

Tsan Sheng Hsu, Ming Yang Kao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings
EditorsHiroshi Nagamochi, Satoru Miyano, Tetsuo Asano, Yoshihide Igarashi, Subhash Suri
PublisherSpringer Verlag
Pages213-222
Number of pages10
ISBN (Print)3540620486, 9783540620488
StatePublished - Jan 1 1996
Event7th International Symposium on Algorithms and Computation, ISAAC 1996 - Osaka, Japan
Duration: Dec 16 1996Dec 18 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1178
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Symposium on Algorithms and Computation, ISAAC 1996
CountryJapan
CityOsaka
Period12/16/9612/18/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimal augmentation for bipartite componentwise biconnectivity in linear time'. Together they form a unique fingerprint.

Cite this